./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Addition03-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Addition03-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b4726bd085117d6d28f7ec87f442bbec9d0d87c17bc39b8147695c8c5a6ec7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:39:30,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:39:30,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:39:30,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:39:30,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:39:30,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:39:30,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:39:30,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:39:30,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:39:30,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:39:30,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:39:30,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:39:30,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:39:30,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:39:30,785 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:39:30,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:39:30,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:39:30,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:39:30,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:30,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:39:30,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:39:30,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:39:30,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:39:30,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:39:30,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:39:30,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:39:30,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b4726bd085117d6d28f7ec87f442bbec9d0d87c17bc39b8147695c8c5a6ec7b [2025-03-09 02:39:30,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:39:31,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:39:31,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:39:31,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:39:31,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:39:31,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Addition03-1.c [2025-03-09 02:39:32,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc753cc/bc2ae486178044a788b3ae41838acc81/FLAGe0f61b31e [2025-03-09 02:39:32,457 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:39:32,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition03-1.c [2025-03-09 02:39:32,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc753cc/bc2ae486178044a788b3ae41838acc81/FLAGe0f61b31e [2025-03-09 02:39:32,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc753cc/bc2ae486178044a788b3ae41838acc81 [2025-03-09 02:39:32,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:39:32,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:39:32,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:32,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:39:32,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:39:32,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6811401f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32, skipping insertion in model container [2025-03-09 02:39:32,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:39:32,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:32,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:39:32,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:32,657 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:39:32,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32 WrapperNode [2025-03-09 02:39:32,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:32,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:32,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:39:32,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:39:32,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,675 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2025-03-09 02:39:32,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:32,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:39:32,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:39:32,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:39:32,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:39:32,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:39:32,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:39:32,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:39:32,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:39:32,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (1/1) ... [2025-03-09 02:39:32,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:32,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:32,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:39:32,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:39:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:39:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:39:32,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:39:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:39:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2025-03-09 02:39:32,784 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2025-03-09 02:39:32,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:39:32,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:39:32,976 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5; [2025-03-09 02:39:32,976 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret4; [2025-03-09 02:39:32,984 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 02:39:32,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:39:32,992 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:39:32,992 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:39:32,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:32 BoogieIcfgContainer [2025-03-09 02:39:32,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:39:32,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:39:32,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:39:32,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:39:33,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:39:32" (1/3) ... [2025-03-09 02:39:33,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702973c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:33, skipping insertion in model container [2025-03-09 02:39:33,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:32" (2/3) ... [2025-03-09 02:39:33,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702973c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:33, skipping insertion in model container [2025-03-09 02:39:33,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:32" (3/3) ... [2025-03-09 02:39:33,003 INFO L128 eAbstractionObserver]: Analyzing ICFG Addition03-1.c [2025-03-09 02:39:33,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:39:33,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Addition03-1.c that has 2 procedures, 36 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 02:39:33,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:39:33,080 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4107111c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:39:33,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 02:39:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:39:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:39:33,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:33,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:33,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:33,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1408505927, now seen corresponding path program 1 times [2025-03-09 02:39:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:33,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626993954] [2025-03-09 02:39:33,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:33,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:33,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:39:33,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:39:33,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:33,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626993954] [2025-03-09 02:39:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626993954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:33,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:33,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445596488] [2025-03-09 02:39:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:33,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:33,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:33,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:33,288 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:33,381 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-03-09 02:39:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:33,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:39:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:33,387 INFO L225 Difference]: With dead ends: 67 [2025-03-09 02:39:33,387 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 02:39:33,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:39:33,392 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:33,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 107 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 02:39:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2025-03-09 02:39:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-09 02:39:33,419 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 7 [2025-03-09 02:39:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:33,419 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-09 02:39:33,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-09 02:39:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:39:33,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:33,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:33,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:39:33,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:33,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 714010778, now seen corresponding path program 1 times [2025-03-09 02:39:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664387140] [2025-03-09 02:39:33,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:33,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:33,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:39:33,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:39:33,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:33,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664387140] [2025-03-09 02:39:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664387140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:33,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:33,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097048782] [2025-03-09 02:39:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:33,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:33,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:33,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:33,469 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:33,517 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-03-09 02:39:33,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:33,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 02:39:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:33,518 INFO L225 Difference]: With dead ends: 67 [2025-03-09 02:39:33,518 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:39:33,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:39:33,519 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:33,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 72 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:39:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-09 02:39:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.475) internal successors, (59), 48 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-03-09 02:39:33,525 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 8 [2025-03-09 02:39:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:33,525 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-03-09 02:39:33,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-03-09 02:39:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:39:33,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:33,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:33,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:39:33,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting additionErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:33,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 659497637, now seen corresponding path program 1 times [2025-03-09 02:39:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:33,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307294279] [2025-03-09 02:39:33,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:33,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:39:33,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:39:33,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:33,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:33,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307294279] [2025-03-09 02:39:33,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307294279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:33,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:33,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:39:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998207953] [2025-03-09 02:39:33,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:33,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:39:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:33,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:39:33,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:39:33,571 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:33,586 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2025-03-09 02:39:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:39:33,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 02:39:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:33,587 INFO L225 Difference]: With dead ends: 53 [2025-03-09 02:39:33,587 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 02:39:33,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:39:33,587 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:33,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 02:39:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 02:39:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.425) internal successors, (57), 47 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-09 02:39:33,593 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 9 [2025-03-09 02:39:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:33,593 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-09 02:39:33,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-03-09 02:39:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:39:33,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:33,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:33,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:39:33,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting additionErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:33,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1030409736, now seen corresponding path program 1 times [2025-03-09 02:39:33,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:33,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440772715] [2025-03-09 02:39:33,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:33,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:33,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:39:33,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:39:33,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:33,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:33,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440772715] [2025-03-09 02:39:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440772715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:33,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667237020] [2025-03-09 02:39:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:33,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:33,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:33,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:33,633 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:33,683 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-03-09 02:39:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:39:33,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 02:39:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:33,685 INFO L225 Difference]: With dead ends: 64 [2025-03-09 02:39:33,685 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 02:39:33,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:39:33,685 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:33,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 02:39:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2025-03-09 02:39:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.35) internal successors, (54), 46 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-09 02:39:33,698 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2025-03-09 02:39:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:33,698 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-09 02:39:33,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-09 02:39:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:39:33,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:33,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:33,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:39:33,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:33,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1029824839, now seen corresponding path program 1 times [2025-03-09 02:39:33,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:33,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424890570] [2025-03-09 02:39:33,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:33,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:33,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:39:33,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:39:33,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:33,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:33,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424890570] [2025-03-09 02:39:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424890570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:33,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:33,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:33,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24886100] [2025-03-09 02:39:33,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:33,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:33,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:33,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:33,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:33,783 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:33,832 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-03-09 02:39:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:39:33,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 02:39:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:33,833 INFO L225 Difference]: With dead ends: 61 [2025-03-09 02:39:33,833 INFO L226 Difference]: Without dead ends: 60 [2025-03-09 02:39:33,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:39:33,834 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:33,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-09 02:39:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-03-09 02:39:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.325) internal successors, (53), 46 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-09 02:39:33,839 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 10 [2025-03-09 02:39:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:33,839 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-09 02:39:33,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-09 02:39:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:39:33,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:33,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:39:33,840 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:33,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash 693179117, now seen corresponding path program 1 times [2025-03-09 02:39:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:33,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956139967] [2025-03-09 02:39:33,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:33,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:39:33,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:39:33,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:33,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:33,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:33,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956139967] [2025-03-09 02:39:33,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956139967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:33,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413919665] [2025-03-09 02:39:33,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:33,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:33,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:33,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:33,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:39:33,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:39:33,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:39:33,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:33,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:33,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:39:33,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:33,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413919665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:34,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 02:39:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034070772] [2025-03-09 02:39:34,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:34,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:39:34,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:34,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:39:34,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:39:34,056 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 12 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:34,192 INFO L93 Difference]: Finished difference Result 158 states and 181 transitions. [2025-03-09 02:39:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:39:34,195 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 02:39:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:34,196 INFO L225 Difference]: With dead ends: 158 [2025-03-09 02:39:34,196 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 02:39:34,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:39:34,196 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 182 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:34,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 145 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 02:39:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2025-03-09 02:39:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.303030303030303) internal successors, (129), 106 states have internal predecessors, (129), 13 states have call successors, (13), 11 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2025-03-09 02:39:34,216 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 16 [2025-03-09 02:39:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:34,216 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2025-03-09 02:39:34,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2025-03-09 02:39:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:39:34,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:34,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:34,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:39:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:39:34,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:34,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -287421037, now seen corresponding path program 1 times [2025-03-09 02:39:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275696167] [2025-03-09 02:39:34,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:34,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:39:34,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:39:34,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:34,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275696167] [2025-03-09 02:39:34,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275696167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590457396] [2025-03-09 02:39:34,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:34,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:34,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:34,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:34,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:39:34,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:39:34,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:39:34,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:34,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:34,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:39:34,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:34,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:39:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590457396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:39:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-09 02:39:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205226789] [2025-03-09 02:39:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:34,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:34,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:34,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:39:34,557 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:34,607 INFO L93 Difference]: Finished difference Result 167 states and 199 transitions. [2025-03-09 02:39:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:39:34,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 02:39:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:34,610 INFO L225 Difference]: With dead ends: 167 [2025-03-09 02:39:34,610 INFO L226 Difference]: Without dead ends: 106 [2025-03-09 02:39:34,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:39:34,613 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:34,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-09 02:39:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 77. [2025-03-09 02:39:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 68 states have internal predecessors, (77), 8 states have call successors, (8), 8 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2025-03-09 02:39:34,627 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 16 [2025-03-09 02:39:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:34,630 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2025-03-09 02:39:34,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2025-03-09 02:39:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 02:39:34,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:34,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:34,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:39:34,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 02:39:34,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -320116945, now seen corresponding path program 1 times [2025-03-09 02:39:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774943492] [2025-03-09 02:39:34,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:34,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:39:34,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:39:34,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:34,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:34,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774943492] [2025-03-09 02:39:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774943492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78422365] [2025-03-09 02:39:34,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:34,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:34,905 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:34,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:39:34,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:39:34,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:39:34,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:34,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:34,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:39:34,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:34,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78422365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:35,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 02:39:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003462906] [2025-03-09 02:39:35,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:39:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:35,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:39:35,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:39:35,035 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:35,122 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2025-03-09 02:39:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:39:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 02:39:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:35,124 INFO L225 Difference]: With dead ends: 179 [2025-03-09 02:39:35,124 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 02:39:35,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:39:35,125 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 95 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:35,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 85 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 02:39:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2025-03-09 02:39:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 140 states have internal predecessors, (158), 17 states have call successors, (17), 17 states have call predecessors, (17), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2025-03-09 02:39:35,146 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 17 [2025-03-09 02:39:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:35,146 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2025-03-09 02:39:35,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2025-03-09 02:39:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:39:35,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:35,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:35,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:39:35,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:35,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:35,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 425785420, now seen corresponding path program 1 times [2025-03-09 02:39:35,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:35,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889320622] [2025-03-09 02:39:35,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:35,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:35,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:39:35,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:39:35,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:35,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:35,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889320622] [2025-03-09 02:39:35,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889320622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:35,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:35,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:35,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053824190] [2025-03-09 02:39:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:35,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:35,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:35,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:35,395 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:35,428 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2025-03-09 02:39:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:39:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 02:39:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:35,429 INFO L225 Difference]: With dead ends: 159 [2025-03-09 02:39:35,429 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 02:39:35,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:39:35,430 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:35,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 02:39:35,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-09 02:39:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2025-03-09 02:39:35,437 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 18 [2025-03-09 02:39:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:35,438 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2025-03-09 02:39:35,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2025-03-09 02:39:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:39:35,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:35,439 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-09 02:39:35,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:39:35,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:35,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash -17340442, now seen corresponding path program 2 times [2025-03-09 02:39:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:35,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291997334] [2025-03-09 02:39:35,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:35,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:35,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-09 02:39:35,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:39:35,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:35,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291997334] [2025-03-09 02:39:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291997334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274328398] [2025-03-09 02:39:35,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:35,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:35,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:39:35,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-09 02:39:35,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:39:35,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:35,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:35,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:39:35,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:35,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:35,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274328398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:35,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-09 02:39:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886838346] [2025-03-09 02:39:35,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:35,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:39:35,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:35,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:39:35,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:39:35,909 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 24 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:36,111 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2025-03-09 02:39:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:39:36,111 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-09 02:39:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:36,112 INFO L225 Difference]: With dead ends: 132 [2025-03-09 02:39:36,112 INFO L226 Difference]: Without dead ends: 131 [2025-03-09 02:39:36,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:39:36,113 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 216 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:36,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 137 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-09 02:39:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-03-09 02:39:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.027027027027027) internal successors, (114), 112 states have internal predecessors, (114), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2025-03-09 02:39:36,126 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 40 [2025-03-09 02:39:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:36,126 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2025-03-09 02:39:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2025-03-09 02:39:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:39:36,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:36,127 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-09 02:39:36,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:39:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:36,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1670363141, now seen corresponding path program 2 times [2025-03-09 02:39:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734343492] [2025-03-09 02:39:36,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:36,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 02:39:36,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:39:36,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:36,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734343492] [2025-03-09 02:39:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734343492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350690165] [2025-03-09 02:39:36,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:36,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:36,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:39:36,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 02:39:36,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:39:36,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:36,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:36,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:39:36,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:36,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:36,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350690165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:36,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:36,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-09 02:39:36,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694244960] [2025-03-09 02:39:36,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:36,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:39:36,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:36,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:39:36,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:39:36,765 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand has 24 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 14 states have internal predecessors, (77), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:36,937 INFO L93 Difference]: Finished difference Result 187 states and 193 transitions. [2025-03-09 02:39:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:39:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 14 states have internal predecessors, (77), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-09 02:39:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:36,939 INFO L225 Difference]: With dead ends: 187 [2025-03-09 02:39:36,939 INFO L226 Difference]: Without dead ends: 186 [2025-03-09 02:39:36,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:39:36,940 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 194 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:36,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 156 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-09 02:39:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2025-03-09 02:39:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.0188679245283019) internal successors, (162), 160 states have internal predecessors, (162), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2025-03-09 02:39:36,964 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 44 [2025-03-09 02:39:36,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:36,964 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2025-03-09 02:39:36,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 14 states have internal predecessors, (77), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2025-03-09 02:39:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 02:39:36,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:36,968 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-09 02:39:36,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:39:37,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 02:39:37,169 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1813921576, now seen corresponding path program 3 times [2025-03-09 02:39:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411699619] [2025-03-09 02:39:37,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:39:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:37,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 11 equivalence classes. [2025-03-09 02:39:37,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:39:37,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:39:37,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411699619] [2025-03-09 02:39:37,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411699619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414579193] [2025-03-09 02:39:37,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:39:37,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:37,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:37,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:37,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:39:37,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 11 equivalence classes. [2025-03-09 02:39:37,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:39:37,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:39:37,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:37,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:39:37,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:37,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414579193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:38,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:38,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-09 02:39:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589011305] [2025-03-09 02:39:38,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 02:39:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:38,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 02:39:38,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 02:39:38,332 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand has 48 states, 45 states have (on average 3.4) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:38,816 INFO L93 Difference]: Finished difference Result 282 states and 294 transitions. [2025-03-09 02:39:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 02:39:38,816 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 3.4) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-09 02:39:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:38,817 INFO L225 Difference]: With dead ends: 282 [2025-03-09 02:39:38,817 INFO L226 Difference]: Without dead ends: 281 [2025-03-09 02:39:38,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-09 02:39:38,820 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 508 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:38,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 222 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-09 02:39:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2025-03-09 02:39:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 243 states have (on average 1.0123456790123457) internal successors, (246), 244 states have internal predecessors, (246), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 279 transitions. [2025-03-09 02:39:38,830 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 279 transitions. Word has length 88 [2025-03-09 02:39:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:38,831 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 279 transitions. [2025-03-09 02:39:38,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 3.4) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 279 transitions. [2025-03-09 02:39:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 02:39:38,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:38,832 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-09 02:39:38,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:39:39,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:39,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1170347899, now seen corresponding path program 3 times [2025-03-09 02:39:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311837642] [2025-03-09 02:39:39,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:39:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:39,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 11 equivalence classes. [2025-03-09 02:39:39,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 02:39:39,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:39:39,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311837642] [2025-03-09 02:39:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311837642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944701820] [2025-03-09 02:39:39,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:39:39,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:39,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:39,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:39,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:39:39,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 11 equivalence classes. [2025-03-09 02:39:39,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 02:39:39,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:39:39,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:39,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:39:39,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:39,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944701820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:40,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:40,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-09 02:39:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144534240] [2025-03-09 02:39:40,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:40,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 02:39:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:40,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 02:39:40,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 02:39:40,251 INFO L87 Difference]: Start difference. First operand 278 states and 279 transitions. Second operand has 48 states, 45 states have (on average 3.8444444444444446) internal successors, (173), 26 states have internal predecessors, (173), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:40,741 INFO L93 Difference]: Finished difference Result 391 states and 403 transitions. [2025-03-09 02:39:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 02:39:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 3.8444444444444446) internal successors, (173), 26 states have internal predecessors, (173), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-09 02:39:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:40,743 INFO L225 Difference]: With dead ends: 391 [2025-03-09 02:39:40,743 INFO L226 Difference]: Without dead ends: 390 [2025-03-09 02:39:40,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-09 02:39:40,746 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 563 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:40,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 271 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-09 02:39:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2025-03-09 02:39:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 339 states have (on average 1.008849557522124) internal successors, (342), 340 states have internal predecessors, (342), 45 states have call successors, (45), 45 states have call predecessors, (45), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 387 transitions. [2025-03-09 02:39:40,763 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 387 transitions. Word has length 98 [2025-03-09 02:39:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:40,763 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-03-09 02:39:40,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 3.8444444444444446) internal successors, (173), 26 states have internal predecessors, (173), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 387 transitions. [2025-03-09 02:39:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-09 02:39:40,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:40,765 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1] [2025-03-09 02:39:40,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:39:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:40,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:40,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash -70701380, now seen corresponding path program 4 times [2025-03-09 02:39:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:40,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154392373] [2025-03-09 02:39:40,969 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:39:40,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:40,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 184 statements into 2 equivalence classes. [2025-03-09 02:39:40,996 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 02:39:40,996 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:39:40,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154392373] [2025-03-09 02:39:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154392373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559475781] [2025-03-09 02:39:42,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:39:42,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:42,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:42,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:39:42,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 184 statements into 2 equivalence classes. [2025-03-09 02:39:42,251 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 02:39:42,251 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:39:42,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:42,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 02:39:42,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:42,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559475781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:44,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-09 02:39:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880793377] [2025-03-09 02:39:44,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-09 02:39:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:44,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-09 02:39:44,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 02:39:44,080 INFO L87 Difference]: Start difference. First operand 386 states and 387 transitions. Second operand has 96 states, 93 states have (on average 3.4516129032258065) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:45,519 INFO L93 Difference]: Finished difference Result 582 states and 606 transitions. [2025-03-09 02:39:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-09 02:39:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 3.4516129032258065) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2025-03-09 02:39:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:45,521 INFO L225 Difference]: With dead ends: 582 [2025-03-09 02:39:45,521 INFO L226 Difference]: Without dead ends: 581 [2025-03-09 02:39:45,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-03-09 02:39:45,525 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1104 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:45,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 414 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:39:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-09 02:39:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 578. [2025-03-09 02:39:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 507 states have (on average 1.0059171597633136) internal successors, (510), 508 states have internal predecessors, (510), 69 states have call successors, (69), 69 states have call predecessors, (69), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 579 transitions. [2025-03-09 02:39:45,549 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 579 transitions. Word has length 184 [2025-03-09 02:39:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:45,549 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 579 transitions. [2025-03-09 02:39:45,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 3.4516129032258065) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:45,550 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 579 transitions. [2025-03-09 02:39:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-09 02:39:45,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:45,554 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1] [2025-03-09 02:39:45,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:39:45,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 02:39:45,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:45,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash 413783675, now seen corresponding path program 4 times [2025-03-09 02:39:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:45,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401799720] [2025-03-09 02:39:45,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:39:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:45,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 206 statements into 2 equivalence classes. [2025-03-09 02:39:45,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 206 of 206 statements. [2025-03-09 02:39:45,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:39:45,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401799720] [2025-03-09 02:39:46,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401799720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090745644] [2025-03-09 02:39:46,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:39:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:46,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:46,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:39:46,917 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 206 statements into 2 equivalence classes. [2025-03-09 02:39:46,950 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 206 of 206 statements. [2025-03-09 02:39:46,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:39:46,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:46,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 02:39:46,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:47,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090745644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:48,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-09 02:39:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572247771] [2025-03-09 02:39:48,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:48,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-09 02:39:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:48,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-09 02:39:48,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 02:39:48,715 INFO L87 Difference]: Start difference. First operand 578 states and 579 transitions. Second operand has 96 states, 93 states have (on average 3.924731182795699) internal successors, (365), 50 states have internal predecessors, (365), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:50,291 INFO L93 Difference]: Finished difference Result 799 states and 823 transitions. [2025-03-09 02:39:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-09 02:39:50,293 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 3.924731182795699) internal successors, (365), 50 states have internal predecessors, (365), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-03-09 02:39:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:50,296 INFO L225 Difference]: With dead ends: 799 [2025-03-09 02:39:50,296 INFO L226 Difference]: Without dead ends: 798 [2025-03-09 02:39:50,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-03-09 02:39:50,301 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1280 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:50,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 526 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:39:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-09 02:39:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 794. [2025-03-09 02:39:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 699 states have (on average 1.0042918454935623) internal successors, (702), 700 states have internal predecessors, (702), 93 states have call successors, (93), 93 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 795 transitions. [2025-03-09 02:39:50,340 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 795 transitions. Word has length 206 [2025-03-09 02:39:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:50,340 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 795 transitions. [2025-03-09 02:39:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 3.924731182795699) internal successors, (365), 50 states have internal predecessors, (365), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:39:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 795 transitions. [2025-03-09 02:39:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-09 02:39:50,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:50,353 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1] [2025-03-09 02:39:50,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:39:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:39:50,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:39:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 683866756, now seen corresponding path program 5 times [2025-03-09 02:39:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885922242] [2025-03-09 02:39:50,554 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:39:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:50,568 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 47 equivalence classes. [2025-03-09 02:39:50,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 376 of 376 statements. [2025-03-09 02:39:50,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:39:50,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:54,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885922242] [2025-03-09 02:39:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885922242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373256729] [2025-03-09 02:39:54,326 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:39:54,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:54,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:54,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:54,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:39:54,365 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 47 equivalence classes. [2025-03-09 02:39:54,486 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 376 of 376 statements. [2025-03-09 02:39:54,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:39:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:54,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-09 02:39:54,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:54,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:40:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373256729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:00,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-09 02:40:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409525669] [2025-03-09 02:40:00,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:00,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-09 02:40:00,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:00,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-09 02:40:00,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-09 02:40:00,231 INFO L87 Difference]: Start difference. First operand 794 states and 795 transitions. Second operand has 192 states, 189 states have (on average 3.4761904761904763) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:06,366 INFO L93 Difference]: Finished difference Result 1182 states and 1230 transitions. [2025-03-09 02:40:06,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-09 02:40:06,367 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 3.4761904761904763) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 376 [2025-03-09 02:40:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:06,370 INFO L225 Difference]: With dead ends: 1182 [2025-03-09 02:40:06,370 INFO L226 Difference]: Without dead ends: 1181 [2025-03-09 02:40:06,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-03-09 02:40:06,374 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2495 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2495 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:06,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2495 Valid, 827 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:40:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-03-09 02:40:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1178. [2025-03-09 02:40:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1035 states have (on average 1.0028985507246377) internal successors, (1038), 1036 states have internal predecessors, (1038), 141 states have call successors, (141), 141 states have call predecessors, (141), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1179 transitions. [2025-03-09 02:40:06,409 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1179 transitions. Word has length 376 [2025-03-09 02:40:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:06,409 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1179 transitions. [2025-03-09 02:40:06,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 3.4761904761904763) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1179 transitions. [2025-03-09 02:40:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-09 02:40:06,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:06,415 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1] [2025-03-09 02:40:06,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:40:06,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 02:40:06,619 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:40:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1951804293, now seen corresponding path program 5 times [2025-03-09 02:40:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531752318] [2025-03-09 02:40:06,620 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:06,630 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 422 statements into 47 equivalence classes. [2025-03-09 02:40:06,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 422 of 422 statements. [2025-03-09 02:40:06,744 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:40:06,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 9545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:40:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531752318] [2025-03-09 02:40:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531752318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280441534] [2025-03-09 02:40:10,663 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:10,668 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:10,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:40:10,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 422 statements into 47 equivalence classes. [2025-03-09 02:40:10,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 422 of 422 statements. [2025-03-09 02:40:10,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:40:10,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:10,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-09 02:40:10,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 9545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:40:11,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 9545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:40:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280441534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:16,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:16,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-09 02:40:16,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743277860] [2025-03-09 02:40:16,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:16,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-09 02:40:16,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:16,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-09 02:40:16,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-09 02:40:16,737 INFO L87 Difference]: Start difference. First operand 1178 states and 1179 transitions. Second operand has 192 states, 189 states have (on average 3.962962962962963) internal successors, (749), 98 states have internal predecessors, (749), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:23,333 INFO L93 Difference]: Finished difference Result 1615 states and 1663 transitions. [2025-03-09 02:40:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-09 02:40:23,334 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 3.962962962962963) internal successors, (749), 98 states have internal predecessors, (749), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 422 [2025-03-09 02:40:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:23,339 INFO L225 Difference]: With dead ends: 1615 [2025-03-09 02:40:23,339 INFO L226 Difference]: Without dead ends: 1614 [2025-03-09 02:40:23,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-03-09 02:40:23,342 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3515 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3515 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:23,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3515 Valid, 997 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:40:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2025-03-09 02:40:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1610. [2025-03-09 02:40:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1419 states have (on average 1.0021141649048626) internal successors, (1422), 1420 states have internal predecessors, (1422), 189 states have call successors, (189), 189 states have call predecessors, (189), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1611 transitions. [2025-03-09 02:40:23,389 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1611 transitions. Word has length 422 [2025-03-09 02:40:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:23,389 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 1611 transitions. [2025-03-09 02:40:23,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 3.962962962962963) internal successors, (749), 98 states have internal predecessors, (749), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1611 transitions. [2025-03-09 02:40:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-03-09 02:40:23,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:23,394 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 94, 1, 1, 1, 1] [2025-03-09 02:40:23,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:40:23,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:40:23,595 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:40:23,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1637723628, now seen corresponding path program 6 times [2025-03-09 02:40:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407295443] [2025-03-09 02:40:23,595 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:23,610 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 760 statements into 95 equivalence classes. [2025-03-09 02:40:23,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 760 of 760 statements. [2025-03-09 02:40:23,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-09 02:40:23,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:40:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407295443] [2025-03-09 02:40:38,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407295443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372841427] [2025-03-09 02:40:38,507 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:38,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:38,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:38,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:38,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:40:38,560 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 760 statements into 95 equivalence classes. [2025-03-09 02:40:38,891 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 760 of 760 statements. [2025-03-09 02:40:38,891 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-09 02:40:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:38,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-09 02:40:38,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:40:39,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372841427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:00,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:00,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-03-09 02:41:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823887172] [2025-03-09 02:41:00,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:00,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-09 02:41:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:00,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-09 02:41:00,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-03-09 02:41:00,213 INFO L87 Difference]: Start difference. First operand 1610 states and 1611 transitions. Second operand has 384 states, 381 states have (on average 3.4881889763779528) internal successors, (1329), 194 states have internal predecessors, (1329), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)