./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/termination-crafted/NestedRecursion_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:09:53,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:09:53,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 11:09:53,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:09:53,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:09:53,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:09:53,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:09:53,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:09:53,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:09:53,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:09:53,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:09:53,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:09:53,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:09:53,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:09:53,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:09:53,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:09:53,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:09:53,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:09:53,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:09:53,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:09:53,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:09:53,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:09:53,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:09:53,335 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:09:53,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:09:53,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:09:53,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:09:53,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:09:53,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:09:53,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:09:53,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:09:53,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:09:53,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:09:53,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:09:53,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:09:53,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:09:53,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:09:53,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:09:53,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:09:53,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:09:53,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:09:53,340 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c [2024-11-09 11:09:53,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:09:53,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:09:53,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:09:53,635 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:09:53,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:09:53,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2024-11-09 11:09:55,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:09:55,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:09:55,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2024-11-09 11:09:55,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ed3b44/6f162849ed2f4999b2393e334f4f0518/FLAG3e53fb6fc [2024-11-09 11:09:55,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ed3b44/6f162849ed2f4999b2393e334f4f0518 [2024-11-09 11:09:55,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:09:55,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:09:55,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:09:55,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:09:55,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:09:55,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c92b71b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55, skipping insertion in model container [2024-11-09 11:09:55,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:09:55,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:09:55,531 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:09:55,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:09:55,559 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:09:55,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55 WrapperNode [2024-11-09 11:09:55,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:09:55,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:09:55,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:09:55,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:09:55,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,582 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2024-11-09 11:09:55,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:09:55,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:09:55,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:09:55,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:09:55,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,598 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 11:09:55,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:09:55,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:09:55,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:09:55,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:09:55,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (1/1) ... [2024-11-09 11:09:55,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:09:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:09:55,633 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) [2024-11-09 11:09:55,635 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 [2024-11-09 11:09:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2024-11-09 11:09:55,678 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2024-11-09 11:09:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2024-11-09 11:09:55,679 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2024-11-09 11:09:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:09:55,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:09:55,730 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:09:55,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:09:55,880 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 11:09:55,880 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:09:55,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:09:55,894 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 11:09:55,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:09:55 BoogieIcfgContainer [2024-11-09 11:09:55,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:09:55,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:09:55,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:09:55,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:09:55,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:09:55" (1/3) ... [2024-11-09 11:09:55,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c7a435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:09:55, skipping insertion in model container [2024-11-09 11:09:55,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:09:55" (2/3) ... [2024-11-09 11:09:55,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c7a435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:09:55, skipping insertion in model container [2024-11-09 11:09:55,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:09:55" (3/3) ... [2024-11-09 11:09:55,911 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2024-11-09 11:09:55,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:09:55,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 11:09:55,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:09:55,983 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;@1d232870, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:09:55,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 11:09:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:09:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:09:55,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:55,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:09:55,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:55,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2132374368, now seen corresponding path program 1 times [2024-11-09 11:09:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008212492] [2024-11-09 11:09:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:09:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008212492] [2024-11-09 11:09:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008212492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:09:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777153582] [2024-11-09 11:09:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:09:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:09:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:56,199 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-09 11:09:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:56,243 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-09 11:09:56,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:09:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-09 11:09:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:56,254 INFO L225 Difference]: With dead ends: 47 [2024-11-09 11:09:56,255 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 11:09:56,258 INFO L431 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 [2024-11-09 11:09:56,262 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:56,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 11:09:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-09 11:09:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:09:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 11:09:56,308 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2024-11-09 11:09:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:56,308 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 11:09:56,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-09 11:09:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-09 11:09:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:09:56,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:56,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:56,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:09:56,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:56,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1679096030, now seen corresponding path program 1 times [2024-11-09 11:09:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074515647] [2024-11-09 11:09:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:09:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074515647] [2024-11-09 11:09:56,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074515647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:56,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:56,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:09:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815010001] [2024-11-09 11:09:56,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:56,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:09:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:56,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:09:56,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:09:56,402 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. 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) [2024-11-09 11:09:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:56,472 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-09 11:09:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:09:56,474 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 [2024-11-09 11:09:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:56,476 INFO L225 Difference]: With dead ends: 57 [2024-11-09 11:09:56,478 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 11:09:56,478 INFO L431 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 [2024-11-09 11:09:56,480 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:56,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 160 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 11:09:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-09 11:09:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:09:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-09 11:09:56,496 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 7 [2024-11-09 11:09:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:56,496 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-09 11:09:56,496 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) [2024-11-09 11:09:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-11-09 11:09:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:09:56,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:56,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:09:56,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -315038040, now seen corresponding path program 1 times [2024-11-09 11:09:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104751825] [2024-11-09 11:09:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:56,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:09:56,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104751825] [2024-11-09 11:09:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104751825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:56,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:56,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:09:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132396834] [2024-11-09 11:09:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:56,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:09:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:09:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:56,559 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:09:56,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:56,582 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-11-09 11:09:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:09:56,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 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 11 [2024-11-09 11:09:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:56,585 INFO L225 Difference]: With dead ends: 52 [2024-11-09 11:09:56,585 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 11:09:56,585 INFO L431 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 [2024-11-09 11:09:56,587 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:56,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 11:09:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-09 11:09:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:09:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-09 11:09:56,597 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 11 [2024-11-09 11:09:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:56,598 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-09 11:09:56,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:09:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-09 11:09:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 11:09:56,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:56,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:09:56,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:56,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1176244610, now seen corresponding path program 1 times [2024-11-09 11:09:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522683572] [2024-11-09 11:09:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:09:56,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:56,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522683572] [2024-11-09 11:09:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522683572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:56,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:09:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161301611] [2024-11-09 11:09:56,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:56,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:09:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:09:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:09:56,715 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-11-09 11:09:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:56,872 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-11-09 11:09:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:09:56,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2024-11-09 11:09:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:56,875 INFO L225 Difference]: With dead ends: 74 [2024-11-09 11:09:56,875 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 11:09:56,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:09:56,877 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 44 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:56,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 224 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:09:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 11:09:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-11-09 11:09:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:09:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-11-09 11:09:56,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 12 [2024-11-09 11:09:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:56,895 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-09 11:09:56,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-11-09 11:09:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2024-11-09 11:09:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 11:09:56,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:56,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:09:56,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:56,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2079532187, now seen corresponding path program 1 times [2024-11-09 11:09:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587309764] [2024-11-09 11:09:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:56,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:09:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:09:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587309764] [2024-11-09 11:09:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587309764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:09:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438286289] [2024-11-09 11:09:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:09:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:09:57,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:09:57,031 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,078 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2024-11-09 11:09:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:09:57,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 11:09:57,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,080 INFO L225 Difference]: With dead ends: 124 [2024-11-09 11:09:57,080 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 11:09:57,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:09:57,082 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 196 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 11:09:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2024-11-09 11:09:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.32) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-09 11:09:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2024-11-09 11:09:57,096 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 18 [2024-11-09 11:09:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,096 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2024-11-09 11:09:57,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2024-11-09 11:09:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 11:09:57,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,097 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:09:57,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,099 INFO L85 PathProgramCache]: Analyzing trace with hash 643212051, now seen corresponding path program 1 times [2024-11-09 11:09:57,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741662903] [2024-11-09 11:09:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:09:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741662903] [2024-11-09 11:09:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741662903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:09:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872922171] [2024-11-09 11:09:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:09:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:09:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:09:57,159 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,193 INFO L93 Difference]: Finished difference Result 98 states and 133 transitions. [2024-11-09 11:09:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:09:57,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 11:09:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,199 INFO L225 Difference]: With dead ends: 98 [2024-11-09 11:09:57,200 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 11:09:57,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:09:57,202 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 11:09:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2024-11-09 11:09:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-09 11:09:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2024-11-09 11:09:57,226 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 19 [2024-11-09 11:09:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,227 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2024-11-09 11:09:57,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2024-11-09 11:09:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:09:57,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,228 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:09:57,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1270071308, now seen corresponding path program 1 times [2024-11-09 11:09:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29432430] [2024-11-09 11:09:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:09:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:09:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:09:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29432430] [2024-11-09 11:09:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29432430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:09:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015604685] [2024-11-09 11:09:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:09:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:09:57,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:09:57,283 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:09:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,302 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2024-11-09 11:09:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:09:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 11:09:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,305 INFO L225 Difference]: With dead ends: 90 [2024-11-09 11:09:57,306 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 11:09:57,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:09:57,309 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 11:09:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-09 11:09:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.271186440677966) internal successors, (75), 65 states have internal predecessors, (75), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-09 11:09:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2024-11-09 11:09:57,327 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 20 [2024-11-09 11:09:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,327 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2024-11-09 11:09:57,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:09:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-11-09 11:09:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:09:57,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,328 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:09:57,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1535262855, now seen corresponding path program 1 times [2024-11-09 11:09:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420747996] [2024-11-09 11:09:57,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:09:57,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420747996] [2024-11-09 11:09:57,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420747996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:09:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525957068] [2024-11-09 11:09:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:09:57,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:09:57,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:57,376 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,400 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2024-11-09 11:09:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:09:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-09 11:09:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,402 INFO L225 Difference]: With dead ends: 87 [2024-11-09 11:09:57,402 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 11:09:57,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:57,403 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 11:09:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 11:09:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 64 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-09 11:09:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-11-09 11:09:57,417 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 20 [2024-11-09 11:09:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,417 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-11-09 11:09:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-11-09 11:09:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:09:57,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,418 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:09:57,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 717504954, now seen corresponding path program 1 times [2024-11-09 11:09:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647708880] [2024-11-09 11:09:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:09:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:09:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:09:57,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647708880] [2024-11-09 11:09:57,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647708880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:09:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451673142] [2024-11-09 11:09:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:09:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:09:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:57,471 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:09:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,480 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2024-11-09 11:09:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:09:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:09:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,482 INFO L225 Difference]: With dead ends: 86 [2024-11-09 11:09:57,482 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 11:09:57,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:57,483 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 11:09:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 11:09:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 60 states have internal predecessors, (67), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-09 11:09:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2024-11-09 11:09:57,499 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 21 [2024-11-09 11:09:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,501 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2024-11-09 11:09:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:09:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2024-11-09 11:09:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:09:57,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,502 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:09:57,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1649259199, now seen corresponding path program 1 times [2024-11-09 11:09:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333137487] [2024-11-09 11:09:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:09:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333137487] [2024-11-09 11:09:57,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333137487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:09:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153460219] [2024-11-09 11:09:57,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:09:57,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:09:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:09:57,604 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,672 INFO L93 Difference]: Finished difference Result 163 states and 218 transitions. [2024-11-09 11:09:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:09:57,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 11:09:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,676 INFO L225 Difference]: With dead ends: 163 [2024-11-09 11:09:57,676 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 11:09:57,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:09:57,679 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 11:09:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2024-11-09 11:09:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.2) internal successors, (72), 67 states have internal predecessors, (72), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2024-11-09 11:09:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-11-09 11:09:57,694 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 25 [2024-11-09 11:09:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,694 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-11-09 11:09:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:09:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-11-09 11:09:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:09:57,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,696 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:09:57,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 853223398, now seen corresponding path program 1 times [2024-11-09 11:09:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261008535] [2024-11-09 11:09:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:09:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:09:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261008535] [2024-11-09 11:09:57,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261008535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:09:57,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030971925] [2024-11-09 11:09:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:09:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:09:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:09:57,794 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:09:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,861 INFO L93 Difference]: Finished difference Result 173 states and 223 transitions. [2024-11-09 11:09:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:09:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 11:09:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,863 INFO L225 Difference]: With dead ends: 173 [2024-11-09 11:09:57,863 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 11:09:57,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:09:57,865 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 195 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 11:09:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2024-11-09 11:09:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 11:09:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2024-11-09 11:09:57,883 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2024-11-09 11:09:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,884 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2024-11-09 11:09:57,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:09:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2024-11-09 11:09:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 11:09:57,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,887 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:09:57,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash -711697781, now seen corresponding path program 1 times [2024-11-09 11:09:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158614537] [2024-11-09 11:09:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:09:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:09:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:09:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 11:09:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158614537] [2024-11-09 11:09:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158614537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:57,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:57,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:09:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932383090] [2024-11-09 11:09:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:57,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:09:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:09:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:57,954 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:09:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:57,969 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2024-11-09 11:09:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:09:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-09 11:09:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:57,971 INFO L225 Difference]: With dead ends: 96 [2024-11-09 11:09:57,971 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 11:09:57,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:09:57,972 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:57,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 11:09:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 11:09:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 71 states have internal predecessors, (75), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 11:09:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2024-11-09 11:09:57,986 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 38 [2024-11-09 11:09:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2024-11-09 11:09:57,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:09:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2024-11-09 11:09:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 11:09:57,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:57,990 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:57,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 11:09:57,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash -587794679, now seen corresponding path program 1 times [2024-11-09 11:09:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:57,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316435070] [2024-11-09 11:09:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:09:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:09:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:09:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:09:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316435070] [2024-11-09 11:09:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316435070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:09:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263088389] [2024-11-09 11:09:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:58,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:09:58,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:09:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:09:58,068 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:09:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:58,091 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-11-09 11:09:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:09:58,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-09 11:09:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:58,095 INFO L225 Difference]: With dead ends: 102 [2024-11-09 11:09:58,095 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 11:09:58,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:09:58,096 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:58,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 11:09:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 11:09:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 75 states have internal predecessors, (81), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 11:09:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2024-11-09 11:09:58,109 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 39 [2024-11-09 11:09:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:58,109 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2024-11-09 11:09:58,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:09:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2024-11-09 11:09:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 11:09:58,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:58,111 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:58,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 11:09:58,111 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:58,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 188454727, now seen corresponding path program 1 times [2024-11-09 11:09:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140482483] [2024-11-09 11:09:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:09:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:09:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:09:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140482483] [2024-11-09 11:09:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140482483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:09:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:09:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584911676] [2024-11-09 11:09:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:58,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:09:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:09:58,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:09:58,247 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:58,295 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2024-11-09 11:09:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:09:58,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-09 11:09:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:58,297 INFO L225 Difference]: With dead ends: 111 [2024-11-09 11:09:58,297 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 11:09:58,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:09:58,298 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:58,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 11:09:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2024-11-09 11:09:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 74 states have internal predecessors, (79), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 11:09:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2024-11-09 11:09:58,313 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 43 [2024-11-09 11:09:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:58,313 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2024-11-09 11:09:58,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2024-11-09 11:09:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:09:58,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:58,314 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:58,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:09:58,315 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 195579087, now seen corresponding path program 1 times [2024-11-09 11:09:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024060757] [2024-11-09 11:09:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:09:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:09:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:09:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 11:09:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024060757] [2024-11-09 11:09:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024060757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:09:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412715065] [2024-11-09 11:09:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:58,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:09:58,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:09:58,477 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) [2024-11-09 11:09:58,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:09:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:09:58,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:09:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:09:58,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:09:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412715065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:58,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:09:58,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-09 11:09:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513499099] [2024-11-09 11:09:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:58,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:09:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:09:58,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:09:58,655 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:58,717 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2024-11-09 11:09:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:09:58,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-09 11:09:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:58,718 INFO L225 Difference]: With dead ends: 101 [2024-11-09 11:09:58,718 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 11:09:58,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:09:58,719 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:58,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 173 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 11:09:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-09 11:09:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 11:09:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2024-11-09 11:09:58,727 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 42 [2024-11-09 11:09:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:58,727 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2024-11-09 11:09:58,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2024-11-09 11:09:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 11:09:58,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:58,728 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:58,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:09:58,932 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,SelfDestructingSolverStorable14 [2024-11-09 11:09:58,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:58,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash 997175283, now seen corresponding path program 1 times [2024-11-09 11:09:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:58,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74073873] [2024-11-09 11:09:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:58,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:09:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:09:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:09:59,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74073873] [2024-11-09 11:09:59,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74073873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:09:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031070079] [2024-11-09 11:09:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:59,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:09:59,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:09:59,063 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) [2024-11-09 11:09:59,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:09:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:09:59,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:09:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 11:09:59,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:09:59,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031070079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:59,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:09:59,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-09 11:09:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856224410] [2024-11-09 11:09:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:59,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:09:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:09:59,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:09:59,193 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:59,322 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2024-11-09 11:09:59,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:09:59,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-11-09 11:09:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:59,324 INFO L225 Difference]: With dead ends: 128 [2024-11-09 11:09:59,326 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 11:09:59,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:09:59,327 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:59,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 173 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:09:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 11:09:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-09 11:09:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.098901098901099) internal successors, (100), 93 states have internal predecessors, (100), 21 states have call successors, (21), 8 states have call predecessors, (21), 11 states have return successors, (31), 24 states have call predecessors, (31), 20 states have call successors, (31) [2024-11-09 11:09:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2024-11-09 11:09:59,343 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 49 [2024-11-09 11:09:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:59,344 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2024-11-09 11:09:59,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2024-11-09 11:09:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:09:59,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:59,345 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:59,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:09:59,549 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,SelfDestructingSolverStorable15 [2024-11-09 11:09:59,550 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:09:59,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:09:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash 330066221, now seen corresponding path program 1 times [2024-11-09 11:09:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:09:59,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469958696] [2024-11-09 11:09:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:59,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:09:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:09:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:09:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:09:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:09:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 11:09:59,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:09:59,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469958696] [2024-11-09 11:09:59,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469958696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:09:59,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107773018] [2024-11-09 11:09:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:09:59,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:09:59,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:09:59,675 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) [2024-11-09 11:09:59,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:09:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:09:59,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:09:59,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:09:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 11:09:59,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:09:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107773018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:09:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:09:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-09 11:09:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779287471] [2024-11-09 11:09:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:09:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:09:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:09:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:09:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:09:59,763 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:09:59,818 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2024-11-09 11:09:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:09:59,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-11-09 11:09:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:09:59,820 INFO L225 Difference]: With dead ends: 155 [2024-11-09 11:09:59,820 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 11:09:59,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:09:59,821 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:09:59,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:09:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 11:09:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-09 11:09:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 111 states have (on average 1.0990990990990992) internal successors, (122), 113 states have internal predecessors, (122), 26 states have call successors, (26), 9 states have call predecessors, (26), 13 states have return successors, (39), 30 states have call predecessors, (39), 25 states have call successors, (39) [2024-11-09 11:09:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 187 transitions. [2024-11-09 11:09:59,834 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 187 transitions. Word has length 47 [2024-11-09 11:09:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:09:59,834 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 187 transitions. [2024-11-09 11:09:59,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:09:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 187 transitions. [2024-11-09 11:09:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 11:09:59,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:09:59,836 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:09:59,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 11:10:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:10:00,036 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:10:00,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:10:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1425732833, now seen corresponding path program 1 times [2024-11-09 11:10:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:10:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005259190] [2024-11-09 11:10:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:10:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:10:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:10:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 11:10:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:10:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 11:10:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:10:00,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005259190] [2024-11-09 11:10:00,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005259190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:10:00,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025575466] [2024-11-09 11:10:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:10:00,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:10:00,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:10:00,140 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) [2024-11-09 11:10:00,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:10:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:10:00,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:10:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 11:10:00,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:10:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 11:10:00,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025575466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:10:00,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:10:00,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 11:10:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738183195] [2024-11-09 11:10:00,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:10:00,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:10:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:10:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:10:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:10:00,351 INFO L87 Difference]: Start difference. First operand 153 states and 187 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 11:10:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:10:00,393 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2024-11-09 11:10:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:10:00,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2024-11-09 11:10:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:10:00,394 INFO L225 Difference]: With dead ends: 175 [2024-11-09 11:10:00,394 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 11:10:00,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:10:00,395 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 211 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 [2024-11-09 11:10:00,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 211 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:10:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 11:10:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-09 11:10:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.089430894308943) internal successors, (134), 125 states have internal predecessors, (134), 26 states have call successors, (26), 9 states have call predecessors, (26), 16 states have return successors, (42), 33 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-09 11:10:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2024-11-09 11:10:00,406 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 60 [2024-11-09 11:10:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:10:00,407 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2024-11-09 11:10:00,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 11:10:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2024-11-09 11:10:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 11:10:00,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:10:00,408 INFO L215 NwaCegarLoop]: trace histogram [10, 8, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:10:00,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:10:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 11:10:00,613 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:10:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:10:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1564735666, now seen corresponding path program 2 times [2024-11-09 11:10:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:10:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160965676] [2024-11-09 11:10:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:10:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:10:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 11:10:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 67 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-09 11:10:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:10:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160965676] [2024-11-09 11:10:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160965676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:10:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762859908] [2024-11-09 11:10:00,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:10:00,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:10:00,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:10:00,762 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) [2024-11-09 11:10:00,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:10:00,812 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:10:00,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:10:00,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:10:00,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:10:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 67 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-09 11:10:00,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:10:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 67 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-09 11:10:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762859908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:10:01,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:10:01,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2024-11-09 11:10:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321029649] [2024-11-09 11:10:01,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:10:01,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:10:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:10:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:10:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:10:01,054 INFO L87 Difference]: Start difference. First operand 168 states and 202 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:10:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:10:01,137 INFO L93 Difference]: Finished difference Result 273 states and 334 transitions. [2024-11-09 11:10:01,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:10:01,138 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2024-11-09 11:10:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:10:01,139 INFO L225 Difference]: With dead ends: 273 [2024-11-09 11:10:01,139 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 11:10:01,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:10:01,141 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:10:01,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:10:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 11:10:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-11-09 11:10:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 12 states have call successors, (12), 7 states have call predecessors, (12), 12 states have return successors, (18), 15 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 11:10:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-11-09 11:10:01,148 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 79 [2024-11-09 11:10:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:10:01,149 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-11-09 11:10:01,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:10:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-09 11:10:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-09 11:10:01,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:10:01,154 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 15, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2024-11-09 11:10:01,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:10:01,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:10:01,355 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-09 11:10:01,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:10:01,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2121158400, now seen corresponding path program 2 times [2024-11-09 11:10:01,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:10:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790311010] [2024-11-09 11:10:01,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:10:01,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:10:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:10:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 11:10:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 11:10:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 11:10:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 11:10:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:10:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:10:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:10:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 11:10:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:10:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 60 proven. 180 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-09 11:10:01,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:10:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790311010] [2024-11-09 11:10:01,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790311010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:10:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670884199] [2024-11-09 11:10:01,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:10:01,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:10:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:10:01,800 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) [2024-11-09 11:10:01,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:10:01,907 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:10:01,907 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:10:01,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:10:01,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:10:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 60 proven. 180 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-09 11:10:02,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:10:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 60 proven. 180 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-09 11:10:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670884199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:10:02,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:10:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2024-11-09 11:10:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349893079] [2024-11-09 11:10:02,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:10:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:10:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:10:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:10:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:10:02,538 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 11:10:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:10:02,691 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-09 11:10:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:10:02,692 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 204 [2024-11-09 11:10:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:10:02,693 INFO L225 Difference]: With dead ends: 104 [2024-11-09 11:10:02,693 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:10:02,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 446 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:10:02,694 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:10:02,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 237 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:10:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:10:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:10:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:10:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:10:02,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2024-11-09 11:10:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:10:02,695 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:10:02,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 11:10:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:10:02,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:10:02,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-11-09 11:10:02,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-11-09 11:10:02,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-11-09 11:10:02,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-11-09 11:10:02,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-11-09 11:10:02,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-11-09 11:10:02,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-11-09 11:10:02,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-11-09 11:10:02,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-11-09 11:10:02,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-11-09 11:10:02,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:10:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:10:02,905 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:10:02,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:10:03,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:10:03,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:10:03 BoogieIcfgContainer [2024-11-09 11:10:03,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:10:03,474 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:10:03,474 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:10:03,474 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:10:03,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:09:55" (3/4) ... [2024-11-09 11:10:03,477 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:10:03,481 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2024-11-09 11:10:03,481 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2024-11-09 11:10:03,487 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-09 11:10:03,487 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:10:03,487 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 11:10:03,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:10:03,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:10:03,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:10:03,577 INFO L158 Benchmark]: Toolchain (without parser) took 8257.35ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 124.2MB in the beginning and 76.4MB in the end (delta: 47.8MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2024-11-09 11:10:03,577 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:10:03,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.11ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.6MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:10:03,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.67ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:10:03,578 INFO L158 Benchmark]: Boogie Preprocessor took 20.36ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:10:03,578 INFO L158 Benchmark]: RCFGBuilder took 289.60ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 132.4MB in the end (delta: -22.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:10:03,578 INFO L158 Benchmark]: TraceAbstraction took 7572.71ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 131.3MB in the beginning and 80.6MB in the end (delta: 50.7MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2024-11-09 11:10:03,578 INFO L158 Benchmark]: Witness Printer took 102.52ms. Allocated memory is still 243.3MB. Free memory was 80.6MB in the beginning and 76.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:10:03,580 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.11ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.6MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.67ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.36ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 289.60ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 132.4MB in the end (delta: -22.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7572.71ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 131.3MB in the beginning and 80.6MB in the end (delta: 50.7MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. * Witness Printer took 102.52ms. Allocated memory is still 243.3MB. Free memory was 80.6MB in the beginning and 76.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 20, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 2941 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2141 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 800 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1082 GetRequests, 951 SyntacticMatches, 11 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=18, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 85 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1272 NumberOfCodeBlocks, 1272 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1586 ConstructedInterpolants, 0 QuantifiedInterpolants, 2376 SizeOfPredicates, 6 NumberOfNonLiveVariables, 967 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 3458/4100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - ProcedureContractResult [Line: 11]: Procedure Contract for rec1 Derived contract for procedure rec1. Requires: (i <= 2147483647) Ensures: (((i <= 2147483647) && ((\result == 0) || (\result == 1))) && ((\result == 0) || (2147483647 == i))) - ProcedureContractResult [Line: 17]: Procedure Contract for rec2 Derived contract for procedure rec2. Requires: (j <= 2147483647) Ensures: ((((0 < ((long) \result + 1)) || (0 < j)) && (j <= 2147483647)) && (((0 < ((long) \result + 1)) || ((2 <= j) && (0 <= ((long) \result + 2147483646)))) || (((long) \result + 1) == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:10:03,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE