./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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_1a-2.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 d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:45:24,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:45:24,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 16:45:24,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:45:24,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:45:24,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:45:24,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:45:24,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:45:24,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:45:24,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:45:24,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:45:24,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:45:24,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:45:24,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:45:24,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:45:24,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:45:24,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:45:24,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:45:24,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:45:24,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:45:24,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:45:24,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:45:24,538 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:45:24,539 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:45:24,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:45:24,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:45:24,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:45:24,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:45:24,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:45:24,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:45:24,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:45:24,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:45:24,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:45:24,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:45:24,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:45:24,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:45:24,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:45:24,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:45:24,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:45:24,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:45:24,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:45:24,544 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 -> d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a [2024-11-12 16:45:24,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:45:24,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:45:24,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:45:24,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:45:24,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:45:24,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2024-11-12 16:45:26,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:45:26,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:45:26,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2024-11-12 16:45:26,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c45b46/cbed42823872463ba59f05fa08044253/FLAG1864775c4 [2024-11-12 16:45:26,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c45b46/cbed42823872463ba59f05fa08044253 [2024-11-12 16:45:26,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:45:26,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:45:26,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:45:26,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:45:26,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:45:26,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:26" (1/1) ... [2024-11-12 16:45:26,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46099e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:26, skipping insertion in model container [2024-11-12 16:45:26,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:26" (1/1) ... [2024-11-12 16:45:26,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:45:27,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:45:27,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:45:27,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:45:27,041 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:45:27,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27 WrapperNode [2024-11-12 16:45:27,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:45:27,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:45:27,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:45:27,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:45:27,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,072 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2024-11-12 16:45:27,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:45:27,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:45:27,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:45:27,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:45:27,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,088 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 16:45:27,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:45:27,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:45:27,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:45:27,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:45:27,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (1/1) ... [2024-11-12 16:45:27,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:45:27,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:45:27,133 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-12 16:45:27,136 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-12 16:45:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2024-11-12 16:45:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2024-11-12 16:45:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2024-11-12 16:45:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2024-11-12 16:45:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:45:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:45:27,243 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:45:27,245 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:45:27,387 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 16:45:27,387 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:45:27,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:45:27,401 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 16:45:27,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:27 BoogieIcfgContainer [2024-11-12 16:45:27,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:45:27,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:45:27,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:45:27,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:45:27,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:45:26" (1/3) ... [2024-11-12 16:45:27,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b55015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:27, skipping insertion in model container [2024-11-12 16:45:27,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:27" (2/3) ... [2024-11-12 16:45:27,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b55015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:27, skipping insertion in model container [2024-11-12 16:45:27,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:27" (3/3) ... [2024-11-12 16:45:27,409 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1a-2.c [2024-11-12 16:45:27,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:45:27,423 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-12 16:45:27,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:45:27,476 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;@5be46159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:45:27,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-12 16:45:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 37 states have internal predecessors, (40), 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-12 16:45:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 16:45:27,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:27,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:27,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:27,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1670154822, now seen corresponding path program 1 times [2024-11-12 16:45:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611526873] [2024-11-12 16:45:27,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:27,655 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-12 16:45:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:27,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611526873] [2024-11-12 16:45:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611526873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:45:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291302547] [2024-11-12 16:45:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:27,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:45:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:45:27,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:27,692 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 37 states have internal predecessors, (40), 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 3.0) internal successors, (6), 3 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-12 16:45:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:27,730 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-11-12 16:45:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:45:27,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-12 16:45:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:27,739 INFO L225 Difference]: With dead ends: 48 [2024-11-12 16:45:27,739 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 16:45:27,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:27,744 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 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-12 16:45:27,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 16:45:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-12 16:45:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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-12 16:45:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-12 16:45:27,776 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 7 [2024-11-12 16:45:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:27,777 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-12 16:45:27,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-12 16:45:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-12 16:45:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 16:45:27,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:27,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:27,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:45:27,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:27,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 235191992, now seen corresponding path program 1 times [2024-11-12 16:45:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706066920] [2024-11-12 16:45:27,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:27,867 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-12 16:45:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706066920] [2024-11-12 16:45:27,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706066920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:27,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:27,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:45:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002414417] [2024-11-12 16:45:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:27,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:45:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:45:27,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:45:27,872 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:45:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:27,961 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-11-12 16:45:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:45:27,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 16:45:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:27,964 INFO L225 Difference]: With dead ends: 60 [2024-11-12 16:45:27,966 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 16:45:27,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:45:27,968 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:27,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 16:45:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-12 16:45:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.375) internal successors, (44), 40 states have internal predecessors, (44), 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-12 16:45:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-11-12 16:45:27,989 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 8 [2024-11-12 16:45:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:27,990 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-11-12 16:45:27,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:45:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-11-12 16:45:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 16:45:27,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:27,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:27,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:45:27,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -339708579, now seen corresponding path program 1 times [2024-11-12 16:45:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214432456] [2024-11-12 16:45:27,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,065 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-12 16:45:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214432456] [2024-11-12 16:45:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214432456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:28,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:45:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226453693] [2024-11-12 16:45:28,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:28,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:45:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:45:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:28,073 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-12 16:45:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:28,118 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-12 16:45:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:45:28,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-12 16:45:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:28,126 INFO L225 Difference]: With dead ends: 53 [2024-11-12 16:45:28,126 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 16:45:28,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:28,128 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 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-12 16:45:28,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:28,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 16:45:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-12 16:45:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.34375) 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-12 16:45:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-12 16:45:28,150 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 12 [2024-11-12 16:45:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:28,150 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-12 16:45:28,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-12 16:45:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-11-12 16:45:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 16:45:28,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:28,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:28,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:45:28,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:28,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1941031319, now seen corresponding path program 1 times [2024-11-12 16:45:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:28,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160493617] [2024-11-12 16:45:28,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,307 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-12 16:45:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160493617] [2024-11-12 16:45:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160493617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:28,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 16:45:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139033458] [2024-11-12 16:45:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 16:45:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 16:45:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:45:28,309 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 16:45:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:28,467 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-12 16:45:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:45:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-12 16:45:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:28,470 INFO L225 Difference]: With dead ends: 77 [2024-11-12 16:45:28,470 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 16:45:28,470 INFO L434 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-12 16:45:28,472 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:28,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 193 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:45:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 16:45:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2024-11-12 16:45:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 51 states have internal predecessors, (60), 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-12 16:45:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-12 16:45:28,485 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 13 [2024-11-12 16:45:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:28,485 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-12 16:45:28,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 16:45:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-11-12 16:45:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 16:45:28,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:28,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:28,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:45:28,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash -915788272, now seen corresponding path program 1 times [2024-11-12 16:45:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:28,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334622954] [2024-11-12 16:45:28,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 16:45:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,599 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-12 16:45:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334622954] [2024-11-12 16:45:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334622954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:28,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:28,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:45:28,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541312433] [2024-11-12 16:45:28,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:28,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:45:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:28,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:45:28,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:45:28,603 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 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-12 16:45:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:28,683 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2024-11-12 16:45:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:45:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 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 19 [2024-11-12 16:45:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:28,686 INFO L225 Difference]: With dead ends: 129 [2024-11-12 16:45:28,687 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 16:45:28,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:45:28,690 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:28,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 106 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:45:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 16:45:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-12 16:45:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-12 16:45:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2024-11-12 16:45:28,709 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 19 [2024-11-12 16:45:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:28,710 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2024-11-12 16:45:28,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 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-12 16:45:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2024-11-12 16:45:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 16:45:28,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:28,711 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:45:28,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2142115886, now seen corresponding path program 1 times [2024-11-12 16:45:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138356111] [2024-11-12 16:45:28,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 16:45:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,791 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-12 16:45:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138356111] [2024-11-12 16:45:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138356111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:45:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002083448] [2024-11-12 16:45:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:28,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:45:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:45:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:45:28,794 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-12 16:45:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:28,822 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2024-11-12 16:45:28,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:45:28,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-12 16:45:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:28,825 INFO L225 Difference]: With dead ends: 91 [2024-11-12 16:45:28,826 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 16:45:28,826 INFO L434 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-12 16:45:28,827 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 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-12 16:45:28,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 16:45:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-11-12 16:45:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-12 16:45:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2024-11-12 16:45:28,851 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 20 [2024-11-12 16:45:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:28,852 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2024-11-12 16:45:28,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-12 16:45:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2024-11-12 16:45:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 16:45:28,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:28,853 INFO L218 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-12 16:45:28,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:45:28,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:28,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1981082982, now seen corresponding path program 1 times [2024-11-12 16:45:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517046866] [2024-11-12 16:45:28,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 16:45:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:28,898 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-12 16:45:28,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517046866] [2024-11-12 16:45:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517046866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:45:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971030625] [2024-11-12 16:45:28,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:45:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:28,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:45:28,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:28,901 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-12 16:45:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:28,913 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2024-11-12 16:45:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:45:28,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 21 [2024-11-12 16:45:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:28,915 INFO L225 Difference]: With dead ends: 74 [2024-11-12 16:45:28,915 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 16:45:28,915 INFO L434 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-12 16:45:28,916 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 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-12 16:45:28,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 16:45:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-12 16:45:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-12 16:45:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2024-11-12 16:45:28,930 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 21 [2024-11-12 16:45:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2024-11-12 16:45:28,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-12 16:45:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2024-11-12 16:45:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 16:45:28,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:28,931 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:28,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:45:28,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:28,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1278041661, now seen corresponding path program 1 times [2024-11-12 16:45:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264269627] [2024-11-12 16:45:28,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 16:45:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,043 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-12 16:45:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264269627] [2024-11-12 16:45:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264269627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:29,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:45:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853555798] [2024-11-12 16:45:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:29,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:45:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:45:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:45:29,047 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12 16:45:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:29,123 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2024-11-12 16:45:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:45:29,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 26 [2024-11-12 16:45:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:29,127 INFO L225 Difference]: With dead ends: 157 [2024-11-12 16:45:29,127 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 16:45:29,129 INFO L434 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-12 16:45:29,129 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 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-12 16:45:29,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 16:45:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2024-11-12 16:45:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 63 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-12 16:45:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2024-11-12 16:45:29,143 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 26 [2024-11-12 16:45:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:29,143 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2024-11-12 16:45:29,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12 16:45:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2024-11-12 16:45:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 16:45:29,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:29,144 INFO L218 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, 1] [2024-11-12 16:45:29,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:45:29,145 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:29,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash 521101748, now seen corresponding path program 1 times [2024-11-12 16:45:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:29,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787751375] [2024-11-12 16:45:29,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 16:45:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 16:45:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,246 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-12 16:45:29,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787751375] [2024-11-12 16:45:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787751375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:45:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257650065] [2024-11-12 16:45:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:45:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:29,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:45:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:45:29,253 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-12 16:45:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:29,310 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2024-11-12 16:45:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:45:29,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 32 [2024-11-12 16:45:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:29,313 INFO L225 Difference]: With dead ends: 169 [2024-11-12 16:45:29,313 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 16:45:29,314 INFO L434 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-12 16:45:29,315 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 200 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-12 16:45:29,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 200 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 16:45:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-11-12 16:45:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 68 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-12 16:45:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2024-11-12 16:45:29,330 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 32 [2024-11-12 16:45:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:29,330 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2024-11-12 16:45:29,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-12 16:45:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2024-11-12 16:45:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 16:45:29,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:29,332 INFO L218 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-12 16:45:29,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:45:29,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:29,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1568699793, now seen corresponding path program 1 times [2024-11-12 16:45:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:29,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520800423] [2024-11-12 16:45:29,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 16:45:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 16:45:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,381 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-12 16:45:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520800423] [2024-11-12 16:45:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520800423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:29,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:29,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:45:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599059934] [2024-11-12 16:45:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:29,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:45:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:45:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:29,385 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-12 16:45:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:29,398 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-12 16:45:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:45:29,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 39 [2024-11-12 16:45:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:29,401 INFO L225 Difference]: With dead ends: 89 [2024-11-12 16:45:29,401 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 16:45:29,401 INFO L434 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-12 16:45:29,402 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 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-12 16:45:29,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 16:45:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-12 16:45:29,417 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), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-12 16:45:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-11-12 16:45:29,418 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 39 [2024-11-12 16:45:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:29,418 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-11-12 16:45:29,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-12 16:45:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-11-12 16:45:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 16:45:29,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:29,419 INFO L218 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, 1] [2024-11-12 16:45:29,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:45:29,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:29,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1385053275, now seen corresponding path program 1 times [2024-11-12 16:45:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577203149] [2024-11-12 16:45:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 16:45:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 16:45:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,483 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-12 16:45:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577203149] [2024-11-12 16:45:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577203149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:29,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:45:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634698362] [2024-11-12 16:45:29,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:29,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:45:29,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:45:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:45:29,486 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-12 16:45:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:29,509 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2024-11-12 16:45:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:45:29,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 40 [2024-11-12 16:45:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:29,511 INFO L225 Difference]: With dead ends: 95 [2024-11-12 16:45:29,513 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 16:45:29,513 INFO L434 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-12 16:45:29,514 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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-12 16:45:29,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 16:45:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-12 16:45:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 71 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-12 16:45:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2024-11-12 16:45:29,527 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 40 [2024-11-12 16:45:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:29,527 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2024-11-12 16:45:29,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-12 16:45:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2024-11-12 16:45:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 16:45:29,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:29,534 INFO L218 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, 1] [2024-11-12 16:45:29,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:45:29,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:29,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1376176296, now seen corresponding path program 1 times [2024-11-12 16:45:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710273727] [2024-11-12 16:45:29,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 16:45:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,629 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-12 16:45:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710273727] [2024-11-12 16:45:29,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710273727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:29,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:45:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814369796] [2024-11-12 16:45:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:29,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:45:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:45:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:45:29,631 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-12 16:45:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:29,672 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-12 16:45:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:45:29,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 44 [2024-11-12 16:45:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:29,674 INFO L225 Difference]: With dead ends: 104 [2024-11-12 16:45:29,674 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 16:45:29,674 INFO L434 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-12 16:45:29,675 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:29,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 173 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 16:45:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-11-12 16:45:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 70 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-12 16:45:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-11-12 16:45:29,685 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 44 [2024-11-12 16:45:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:29,685 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-11-12 16:45:29,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-12 16:45:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-11-12 16:45:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 16:45:29,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:29,686 INFO L218 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, 1] [2024-11-12 16:45:29,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:45:29,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:29,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:29,687 INFO L85 PathProgramCache]: Analyzing trace with hash 620191462, now seen corresponding path program 1 times [2024-11-12 16:45:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954417192] [2024-11-12 16:45:29,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:29,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 16:45:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,811 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-12 16:45:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954417192] [2024-11-12 16:45:29,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954417192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:45:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458878045] [2024-11-12 16:45:29,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:45:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:45:29,815 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-12 16:45:29,817 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-12 16:45:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:29,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 16:45:29,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:45:29,934 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-12 16:45:29,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:45:30,119 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-12 16:45:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458878045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:45:30,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:45:30,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-12 16:45:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801310928] [2024-11-12 16:45:30,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:45:30,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:45:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:30,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:45:30,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:45:30,125 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 16:45:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:30,378 INFO L93 Difference]: Finished difference Result 195 states and 254 transitions. [2024-11-12 16:45:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 16:45:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2024-11-12 16:45:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:30,380 INFO L225 Difference]: With dead ends: 195 [2024-11-12 16:45:30,380 INFO L226 Difference]: Without dead ends: 193 [2024-11-12 16:45:30,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-12 16:45:30,381 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 102 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:30,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 382 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:45:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-12 16:45:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 118. [2024-11-12 16:45:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 88 states have internal predecessors, (96), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (34), 22 states have call predecessors, (34), 19 states have call successors, (34) [2024-11-12 16:45:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2024-11-12 16:45:30,401 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 43 [2024-11-12 16:45:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:30,401 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2024-11-12 16:45:30,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 16:45:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2024-11-12 16:45:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 16:45:30,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:30,402 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:30,422 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-12 16:45:30,603 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,SelfDestructingSolverStorable12 [2024-11-12 16:45:30,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:30,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1849169360, now seen corresponding path program 1 times [2024-11-12 16:45:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452219799] [2024-11-12 16:45:30,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:30,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:30,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:30,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-12 16:45:30,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:30,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452219799] [2024-11-12 16:45:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452219799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:45:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77115219] [2024-11-12 16:45:30,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:30,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:45:30,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:45:30,722 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-12 16:45:30,723 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-12 16:45:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:30,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:45:30,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:45:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-12 16:45:30,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:45:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77115219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:30,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:45:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-12 16:45:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127193489] [2024-11-12 16:45:30,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:30,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:45:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:30,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:45:30,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:45:30,823 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-12 16:45:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:30,946 INFO L93 Difference]: Finished difference Result 152 states and 193 transitions. [2024-11-12 16:45:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 16:45:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 55 [2024-11-12 16:45:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:30,950 INFO L225 Difference]: With dead ends: 152 [2024-11-12 16:45:30,950 INFO L226 Difference]: Without dead ends: 151 [2024-11-12 16:45:30,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 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-12 16:45:30,951 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 186 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-12 16:45:30,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 186 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:45:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-12 16:45:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2024-11-12 16:45:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.145631067961165) internal successors, (118), 108 states have internal predecessors, (118), 25 states have call successors, (25), 8 states have call predecessors, (25), 12 states have return successors, (41), 28 states have call predecessors, (41), 24 states have call successors, (41) [2024-11-12 16:45:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 184 transitions. [2024-11-12 16:45:30,966 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 184 transitions. Word has length 55 [2024-11-12 16:45:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:30,966 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 184 transitions. [2024-11-12 16:45:30,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-12 16:45:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2024-11-12 16:45:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 16:45:30,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:30,967 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:30,985 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-12 16:45:31,171 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,SelfDestructingSolverStorable13 [2024-11-12 16:45:31,172 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:31,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash -997022116, now seen corresponding path program 1 times [2024-11-12 16:45:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:31,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538358359] [2024-11-12 16:45:31,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 16:45:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 16:45:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-12 16:45:31,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538358359] [2024-11-12 16:45:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538358359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:31,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:45:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200148971] [2024-11-12 16:45:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:31,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:45:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:45:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:45:31,248 INFO L87 Difference]: Start difference. First operand 145 states and 184 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 16:45:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:31,271 INFO L93 Difference]: Finished difference Result 159 states and 206 transitions. [2024-11-12 16:45:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:45:31,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2024-11-12 16:45:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:31,273 INFO L225 Difference]: With dead ends: 159 [2024-11-12 16:45:31,274 INFO L226 Difference]: Without dead ends: 158 [2024-11-12 16:45:31,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-12 16:45:31,275 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 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-12 16:45:31,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-12 16:45:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-11-12 16:45:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.135135135135135) internal successors, (126), 115 states have internal predecessors, (126), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (47), 31 states have call predecessors, (47), 24 states have call successors, (47) [2024-11-12 16:45:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2024-11-12 16:45:31,294 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2024-11-12 16:45:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:31,296 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2024-11-12 16:45:31,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 16:45:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2024-11-12 16:45:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 16:45:31,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:31,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:31,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 16:45:31,298 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -842914454, now seen corresponding path program 1 times [2024-11-12 16:45:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984043840] [2024-11-12 16:45:31,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 16:45:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 16:45:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-12 16:45:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984043840] [2024-11-12 16:45:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984043840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:31,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:45:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021210092] [2024-11-12 16:45:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:31,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:45:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:45:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:31,344 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 16:45:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:31,356 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2024-11-12 16:45:31,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:45:31,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-12 16:45:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:31,359 INFO L225 Difference]: With dead ends: 155 [2024-11-12 16:45:31,359 INFO L226 Difference]: Without dead ends: 151 [2024-11-12 16:45:31,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12 16:45:31,360 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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-12 16:45:31,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-12 16:45:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-12 16:45:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.1111111111111112) internal successors, (120), 112 states have internal predecessors, (120), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (45), 30 states have call predecessors, (45), 24 states have call successors, (45) [2024-11-12 16:45:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2024-11-12 16:45:31,375 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 46 [2024-11-12 16:45:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:31,375 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2024-11-12 16:45:31,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 16:45:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2024-11-12 16:45:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 16:45:31,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:31,376 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:31,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 16:45:31,376 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:31,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1953786223, now seen corresponding path program 1 times [2024-11-12 16:45:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179576649] [2024-11-12 16:45:31,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 16:45:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 16:45:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 16:45:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-12 16:45:31,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179576649] [2024-11-12 16:45:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179576649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:31,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:45:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507609439] [2024-11-12 16:45:31,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 16:45:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:31,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 16:45:31,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:45:31,539 INFO L87 Difference]: Start difference. First operand 151 states and 190 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 16:45:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:31,604 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2024-11-12 16:45:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:45:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2024-11-12 16:45:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:31,606 INFO L225 Difference]: With dead ends: 151 [2024-11-12 16:45:31,606 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 16:45:31,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:45:31,607 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:31,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 189 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 16:45:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2024-11-12 16:45:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 87 states have internal predecessors, (92), 19 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (31), 21 states have call predecessors, (31), 16 states have call successors, (31) [2024-11-12 16:45:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2024-11-12 16:45:31,619 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 85 [2024-11-12 16:45:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:31,619 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2024-11-12 16:45:31,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 16:45:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2024-11-12 16:45:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 16:45:31,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:31,621 INFO L218 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, 1] [2024-11-12 16:45:31,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 16:45:31,621 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-12 16:45:31,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1333842528, now seen corresponding path program 2 times [2024-11-12 16:45:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634926409] [2024-11-12 16:45:31,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 16:45:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 16:45:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:31,779 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-12 16:45:31,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:31,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634926409] [2024-11-12 16:45:31,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634926409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:45:31,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647289333] [2024-11-12 16:45:31,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:45:31,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:45:31,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:45:31,781 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-12 16:45:31,782 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-12 16:45:31,833 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:45:31,833 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:45:31,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 16:45:31,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:45:31,899 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-12 16:45:31,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:45:32,071 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-12 16:45:32,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647289333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:45:32,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:45:32,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2024-11-12 16:45:32,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253210702] [2024-11-12 16:45:32,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:45:32,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 16:45:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:32,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 16:45:32,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:45:32,075 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-12 16:45:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:32,156 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2024-11-12 16:45:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:45:32,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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 80 [2024-11-12 16:45:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:32,158 INFO L225 Difference]: With dead ends: 175 [2024-11-12 16:45:32,158 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 16:45:32,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 169 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-12 16:45:32,159 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:32,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:45:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 16:45:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 16:45:32,160 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-12 16:45:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 16:45:32,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-11-12 16:45:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:32,160 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 16:45:32,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-12 16:45:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 16:45:32,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 16:45:32,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-11-12 16:45:32,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-11-12 16:45:32,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-11-12 16:45:32,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-11-12 16:45:32,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-11-12 16:45:32,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-11-12 16:45:32,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-11-12 16:45:32,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-11-12 16:45:32,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-11-12 16:45:32,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-11-12 16:45:32,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 16:45:32,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 16:45:32,373 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:32,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 16:45:32,845 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:45:32,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:45:32 BoogieIcfgContainer [2024-11-12 16:45:32,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:45:32,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:45:32,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:45:32,872 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:45:32,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:27" (3/4) ... [2024-11-12 16:45:32,875 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 16:45:32,878 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2024-11-12 16:45:32,878 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2024-11-12 16:45:32,884 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-12 16:45:32,885 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 16:45:32,885 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-12 16:45:32,967 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:45:32,967 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 16:45:32,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:45:32,968 INFO L158 Benchmark]: Toolchain (without parser) took 6162.47ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 80.2MB in the beginning and 138.7MB in the end (delta: -58.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:45:32,968 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:45:32,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.78ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 124.4MB in the end (delta: -44.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-12 16:45:32,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.79ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 123.6MB in the end (delta: 872.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:45:32,968 INFO L158 Benchmark]: Boogie Preprocessor took 21.72ms. Allocated memory is still 151.0MB. Free memory was 123.6MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:45:32,969 INFO L158 Benchmark]: RCFGBuilder took 306.72ms. Allocated memory is still 151.0MB. Free memory was 121.4MB in the beginning and 109.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 16:45:32,969 INFO L158 Benchmark]: TraceAbstraction took 5468.22ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 109.8MB in the beginning and 142.9MB in the end (delta: -33.2MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2024-11-12 16:45:32,970 INFO L158 Benchmark]: Witness Printer took 95.55ms. Allocated memory is still 192.9MB. Free memory was 142.9MB in the beginning and 138.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:45:32,974 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 151.0MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.78ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 124.4MB in the end (delta: -44.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.79ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 123.6MB in the end (delta: 872.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.72ms. Allocated memory is still 151.0MB. Free memory was 123.6MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.72ms. Allocated memory is still 151.0MB. Free memory was 121.4MB in the beginning and 109.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5468.22ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 109.8MB in the beginning and 142.9MB in the end (delta: -33.2MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. * Witness Printer took 95.55ms. Allocated memory is still 192.9MB. Free memory was 142.9MB in the beginning and 138.7MB 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, 46 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 359 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 2622 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1896 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 702 IncrementalHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 726 mSDtfsCounter, 702 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 407 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=15, InterpolantAutomatonStates: 110, 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, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 1383 SizeOfPredicates, 3 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 1002/1094 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 < 1) || (\result == 1)) && (i <= 2147483647)) && ((\result == 0) || (0 < i))) - ProcedureContractResult [Line: 17]: Procedure Contract for rec2 Derived contract for procedure rec2. Requires: (j < 2147483647) Ensures: ((0 <= \result) && (j <= 2147483646)) RESULT: Ultimate proved your program to be correct! [2024-11-12 16:45:33,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE