./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.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 e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:44:18,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:44:18,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:44:18,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:44:18,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:44:18,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:44:18,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:44:18,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:44:18,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:44:18,745 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:44:18,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:44:18,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:44:18,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:44:18,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:44:18,747 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:44:18,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:44:18,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:44:18,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:44:18,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:44:18,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:44:18,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:44:18,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:44:18,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:44:18,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:44:18,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:44:18,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:44:18,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:44:18,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:44:18,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:44:18,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:44:18,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:44:18,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:44:18,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:44:18,750 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 [2025-03-17 14:44:18,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:44:18,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:44:19,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:44:19,001 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:44:19,002 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:44:19,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2025-03-17 14:44:20,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e441f8909/79abb0f2aa6b4e5a95f33f706f539e9e/FLAGcb19c4361 [2025-03-17 14:44:20,306 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:44:20,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2025-03-17 14:44:20,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e441f8909/79abb0f2aa6b4e5a95f33f706f539e9e/FLAGcb19c4361 [2025-03-17 14:44:20,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e441f8909/79abb0f2aa6b4e5a95f33f706f539e9e [2025-03-17 14:44:20,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:44:20,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:44:20,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:44:20,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:44:20,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:44:20,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb58253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20, skipping insertion in model container [2025-03-17 14:44:20,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:44:20,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:44:20,429 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:44:20,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:44:20,447 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:44:20,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20 WrapperNode [2025-03-17 14:44:20,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:44:20,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:44:20,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:44:20,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:44:20,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,468 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2025-03-17 14:44:20,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:44:20,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:44:20,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:44:20,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:44:20,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,480 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:44:20,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:44:20,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:44:20,483 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:44:20,483 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:44:20,484 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (1/1) ... [2025-03-17 14:44:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:44:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:20,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:44:20,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:44:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-03-17 14:44:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-03-17 14:44:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:44:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:44:20,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:44:20,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:44:20,646 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 14:44:20,647 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:44:20,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:44:20,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:44:20,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:20 BoogieIcfgContainer [2025-03-17 14:44:20,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:44:20,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:44:20,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:44:20,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:44:20,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:44:20" (1/3) ... [2025-03-17 14:44:20,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742ae8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:44:20, skipping insertion in model container [2025-03-17 14:44:20,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:20" (2/3) ... [2025-03-17 14:44:20,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742ae8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:44:20, skipping insertion in model container [2025-03-17 14:44:20,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:20" (3/3) ... [2025-03-17 14:44:20,659 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c.c [2025-03-17 14:44:20,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:44:20,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_2c.c that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-17 14:44:20,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:44:20,710 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;@22b1d9ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:44:20,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 14:44:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 14:44:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:44:20,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:20,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:44:20,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1537586961, now seen corresponding path program 1 times [2025-03-17 14:44:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:20,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491498390] [2025-03-17 14:44:20,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:20,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:20,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:44:20,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:44:20,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:20,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:20,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491498390] [2025-03-17 14:44:20,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491498390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:20,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:20,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:44:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683267997] [2025-03-17 14:44:20,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:20,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:44:20,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:20,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:44:20,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:20,875 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:20,956 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-03-17 14:44:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:44:20,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:44:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:20,962 INFO L225 Difference]: With dead ends: 42 [2025-03-17 14:44:20,962 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 14:44:20,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:20,967 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:20,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 14:44:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-17 14:44:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 14:44:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-17 14:44:20,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 6 [2025-03-17 14:44:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:20,998 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-17 14:44:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-17 14:44:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:44:20,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:20,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:20,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:44:20,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:21,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash 420555514, now seen corresponding path program 1 times [2025-03-17 14:44:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575863346] [2025-03-17 14:44:21,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:21,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:44:21,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:44:21,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:21,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:21,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575863346] [2025-03-17 14:44:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575863346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:21,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507865693] [2025-03-17 14:44:21,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:21,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:44:21,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:21,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:44:21,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:21,062 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 4 states have (on average 1.5) 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) [2025-03-17 14:44:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:21,122 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-03-17 14:44:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:44:21,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) 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 [2025-03-17 14:44:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:21,125 INFO L225 Difference]: With dead ends: 46 [2025-03-17 14:44:21,125 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 14:44:21,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:21,127 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:21,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 14:44:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-03-17 14:44:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 31 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 14:44:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-03-17 14:44:21,136 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2025-03-17 14:44:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:21,136 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-03-17 14:44:21,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) 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) [2025-03-17 14:44:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-03-17 14:44:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:44:21,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:21,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:21,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:44:21,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:21,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2043867572, now seen corresponding path program 1 times [2025-03-17 14:44:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:21,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502254237] [2025-03-17 14:44:21,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:21,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:44:21,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:44:21,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:21,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502254237] [2025-03-17 14:44:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502254237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225606344] [2025-03-17 14:44:21,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:21,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:21,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:21,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:44:21,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:44:21,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:44:21,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:21,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:21,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:44:21,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:21,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225606344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:21,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 14:44:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165871546] [2025-03-17 14:44:21,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:21,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:44:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:21,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:44:21,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:44:21,358 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:21,518 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2025-03-17 14:44:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:44:21,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:44:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:21,519 INFO L225 Difference]: With dead ends: 95 [2025-03-17 14:44:21,519 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 14:44:21,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:44:21,520 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 135 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:21,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 121 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 14:44:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2025-03-17 14:44:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 58 states have internal predecessors, (74), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 14:44:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2025-03-17 14:44:21,534 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 11 [2025-03-17 14:44:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:21,534 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2025-03-17 14:44:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2025-03-17 14:44:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:44:21,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:21,534 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:21,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:44:21,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:21,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash 880627710, now seen corresponding path program 1 times [2025-03-17 14:44:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566598083] [2025-03-17 14:44:21,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:21,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:44:21,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:44:21,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:21,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:21,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:21,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566598083] [2025-03-17 14:44:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566598083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:21,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:21,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33487155] [2025-03-17 14:44:21,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:21,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:21,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:21,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:21,786 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:21,812 INFO L93 Difference]: Finished difference Result 116 states and 165 transitions. [2025-03-17 14:44:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:21,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 14:44:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:21,816 INFO L225 Difference]: With dead ends: 116 [2025-03-17 14:44:21,816 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 14:44:21,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:21,817 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 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 [2025-03-17 14:44:21,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 14:44:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2025-03-17 14:44:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 74 states have internal predecessors, (91), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-17 14:44:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2025-03-17 14:44:21,837 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 14 [2025-03-17 14:44:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:21,837 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2025-03-17 14:44:21,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2025-03-17 14:44:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:44:21,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:21,838 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:21,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:44:21,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:21,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1529655207, now seen corresponding path program 1 times [2025-03-17 14:44:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656504696] [2025-03-17 14:44:21,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:21,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:21,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:44:21,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:44:21,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:21,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:21,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656504696] [2025-03-17 14:44:21,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656504696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:21,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:21,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:21,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696513722] [2025-03-17 14:44:21,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:21,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:21,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:21,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:21,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:21,868 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:21,877 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2025-03-17 14:44:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 14:44:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:21,878 INFO L225 Difference]: With dead ends: 98 [2025-03-17 14:44:21,878 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 14:44:21,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:21,881 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 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 [2025-03-17 14:44:21,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:21,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 14:44:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 14:44:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 73 states have internal predecessors, (85), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-17 14:44:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2025-03-17 14:44:21,898 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 15 [2025-03-17 14:44:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:21,899 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2025-03-17 14:44:21,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2025-03-17 14:44:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:44:21,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:21,899 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:44:21,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1872000069, now seen corresponding path program 1 times [2025-03-17 14:44:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65398961] [2025-03-17 14:44:21,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:21,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:44:21,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:44:21,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:21,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65398961] [2025-03-17 14:44:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65398961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23669242] [2025-03-17 14:44:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:21,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:21,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:21,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:21,947 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:22,039 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2025-03-17 14:44:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:44:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-17 14:44:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:22,040 INFO L225 Difference]: With dead ends: 136 [2025-03-17 14:44:22,040 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 14:44:22,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:44:22,041 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:22,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 78 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 14:44:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2025-03-17 14:44:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 97 states have internal predecessors, (106), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (32), 20 states have call predecessors, (32), 19 states have call successors, (32) [2025-03-17 14:44:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2025-03-17 14:44:22,058 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 19 [2025-03-17 14:44:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:22,058 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2025-03-17 14:44:22,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2025-03-17 14:44:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:44:22,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:22,058 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:44:22,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:22,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2097539984, now seen corresponding path program 1 times [2025-03-17 14:44:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007692220] [2025-03-17 14:44:22,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:22,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:44:22,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:44:22,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:22,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:22,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:22,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007692220] [2025-03-17 14:44:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007692220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:22,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426033402] [2025-03-17 14:44:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:22,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:22,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:22,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:22,117 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:22,198 INFO L93 Difference]: Finished difference Result 155 states and 200 transitions. [2025-03-17 14:44:22,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:44:22,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 14:44:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:22,200 INFO L225 Difference]: With dead ends: 155 [2025-03-17 14:44:22,200 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 14:44:22,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:44:22,201 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:22,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 75 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 14:44:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2025-03-17 14:44:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 111 states have internal predecessors, (121), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) [2025-03-17 14:44:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2025-03-17 14:44:22,223 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 20 [2025-03-17 14:44:22,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:22,223 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2025-03-17 14:44:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2025-03-17 14:44:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 14:44:22,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:22,224 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:22,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:44:22,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1778619362, now seen corresponding path program 2 times [2025-03-17 14:44:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919897739] [2025-03-17 14:44:22,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:22,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 14:44:22,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:44:22,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:22,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919897739] [2025-03-17 14:44:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919897739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:22,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602895282] [2025-03-17 14:44:22,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:22,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:22,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:22,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:22,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:44:22,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 14:44:22,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:44:22,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:22,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:22,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:44:22,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:22,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602895282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:22,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:22,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 14:44:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080794670] [2025-03-17 14:44:22,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:44:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:22,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:44:22,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:44:22,505 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:22,798 INFO L93 Difference]: Finished difference Result 214 states and 276 transitions. [2025-03-17 14:44:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 14:44:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-17 14:44:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:22,800 INFO L225 Difference]: With dead ends: 214 [2025-03-17 14:44:22,800 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 14:44:22,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2025-03-17 14:44:22,801 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 133 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:22,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 152 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:44:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 14:44:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2025-03-17 14:44:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 141 states have (on average 1.177304964539007) internal successors, (166), 153 states have internal predecessors, (166), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) [2025-03-17 14:44:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 252 transitions. [2025-03-17 14:44:22,825 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 252 transitions. Word has length 24 [2025-03-17 14:44:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:22,825 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 252 transitions. [2025-03-17 14:44:22,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 252 transitions. [2025-03-17 14:44:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 14:44:22,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:22,826 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-17 14:44:22,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:44:23,026 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,SelfDestructingSolverStorable7 [2025-03-17 14:44:23,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -819218223, now seen corresponding path program 2 times [2025-03-17 14:44:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930010656] [2025-03-17 14:44:23,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:23,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:44:23,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:44:23,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:23,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930010656] [2025-03-17 14:44:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930010656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575381623] [2025-03-17 14:44:23,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:23,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:23,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:23,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:44:23,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:44:23,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:44:23,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:23,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:23,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:44:23,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:23,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575381623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:23,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-17 14:44:23,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471674908] [2025-03-17 14:44:23,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:23,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 14:44:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:23,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 14:44:23,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:44:23,373 INFO L87 Difference]: Start difference. First operand 197 states and 252 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:23,660 INFO L93 Difference]: Finished difference Result 318 states and 413 transitions. [2025-03-17 14:44:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:44:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 14:44:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:23,663 INFO L225 Difference]: With dead ends: 318 [2025-03-17 14:44:23,663 INFO L226 Difference]: Without dead ends: 317 [2025-03-17 14:44:23,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 14:44:23,664 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 316 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:23,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 247 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:44:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-17 14:44:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2025-03-17 14:44:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 219 states have (on average 1.1689497716894977) internal successors, (256), 237 states have internal predecessors, (256), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2025-03-17 14:44:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 390 transitions. [2025-03-17 14:44:23,682 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 390 transitions. Word has length 26 [2025-03-17 14:44:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:23,682 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 390 transitions. [2025-03-17 14:44:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 390 transitions. [2025-03-17 14:44:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 14:44:23,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:23,683 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:23,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:44:23,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:23,888 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:23,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2117720669, now seen corresponding path program 1 times [2025-03-17 14:44:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118888019] [2025-03-17 14:44:23,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:23,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:44:23,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:44:23,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:23,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:23,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:23,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118888019] [2025-03-17 14:44:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118888019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:23,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:44:23,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447429838] [2025-03-17 14:44:23,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:23,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:44:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:23,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:44:23,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:23,932 INFO L87 Difference]: Start difference. First operand 305 states and 390 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:23,954 INFO L93 Difference]: Finished difference Result 305 states and 390 transitions. [2025-03-17 14:44:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:44:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-17 14:44:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:23,956 INFO L225 Difference]: With dead ends: 305 [2025-03-17 14:44:23,957 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 14:44:23,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:23,958 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:23,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 14:44:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-17 14:44:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.091324200913242) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2025-03-17 14:44:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 373 transitions. [2025-03-17 14:44:23,976 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 373 transitions. Word has length 30 [2025-03-17 14:44:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:23,976 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 373 transitions. [2025-03-17 14:44:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 373 transitions. [2025-03-17 14:44:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 14:44:23,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:23,981 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:44:23,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -504400586, now seen corresponding path program 1 times [2025-03-17 14:44:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861498018] [2025-03-17 14:44:23,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:23,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:44:23,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:44:23,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:23,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:24,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861498018] [2025-03-17 14:44:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861498018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:24,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:44:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580112509] [2025-03-17 14:44:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:44:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:24,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:44:24,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:24,043 INFO L87 Difference]: Start difference. First operand 304 states and 373 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:24,143 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2025-03-17 14:44:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:44:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-17 14:44:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:24,145 INFO L225 Difference]: With dead ends: 326 [2025-03-17 14:44:24,145 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 14:44:24,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:44:24,147 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:24,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 14:44:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2025-03-17 14:44:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 231 states have (on average 1.0952380952380953) internal successors, (253), 248 states have internal predecessors, (253), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2025-03-17 14:44:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 378 transitions. [2025-03-17 14:44:24,164 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 378 transitions. Word has length 35 [2025-03-17 14:44:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:24,164 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 378 transitions. [2025-03-17 14:44:24,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 378 transitions. [2025-03-17 14:44:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 14:44:24,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:24,165 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:24,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:44:24,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1543450997, now seen corresponding path program 1 times [2025-03-17 14:44:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:24,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536261981] [2025-03-17 14:44:24,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:24,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:24,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:44:24,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:44:24,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:24,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536261981] [2025-03-17 14:44:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536261981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:24,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:44:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926994461] [2025-03-17 14:44:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:24,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:44:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:24,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:44:24,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:24,236 INFO L87 Difference]: Start difference. First operand 320 states and 378 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:24,319 INFO L93 Difference]: Finished difference Result 325 states and 414 transitions. [2025-03-17 14:44:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:44:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-17 14:44:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:24,321 INFO L225 Difference]: With dead ends: 325 [2025-03-17 14:44:24,321 INFO L226 Difference]: Without dead ends: 324 [2025-03-17 14:44:24,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:44:24,322 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:24,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-17 14:44:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2025-03-17 14:44:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 231 states have (on average 1.0865800865800865) internal successors, (251), 247 states have internal predecessors, (251), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2025-03-17 14:44:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 376 transitions. [2025-03-17 14:44:24,337 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 376 transitions. Word has length 36 [2025-03-17 14:44:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 376 transitions. [2025-03-17 14:44:24,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 376 transitions. [2025-03-17 14:44:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:44:24,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:24,338 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:44:24,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -128805765, now seen corresponding path program 3 times [2025-03-17 14:44:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566949011] [2025-03-17 14:44:24,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:44:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:24,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-03-17 14:44:24,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:44:24,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 14:44:24,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566949011] [2025-03-17 14:44:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566949011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607138158] [2025-03-17 14:44:24,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:44:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:24,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:24,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:44:24,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-03-17 14:44:24,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:44:24,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 14:44:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:24,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:44:24,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:24,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607138158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:24,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-17 14:44:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872514081] [2025-03-17 14:44:24,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:24,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 14:44:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:24,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 14:44:24,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-03-17 14:44:24,757 INFO L87 Difference]: Start difference. First operand 319 states and 376 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:25,379 INFO L93 Difference]: Finished difference Result 455 states and 579 transitions. [2025-03-17 14:44:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 14:44:25,379 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-03-17 14:44:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:25,381 INFO L225 Difference]: With dead ends: 455 [2025-03-17 14:44:25,381 INFO L226 Difference]: Without dead ends: 454 [2025-03-17 14:44:25,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=721, Invalid=2471, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 14:44:25,383 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 387 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:25,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 238 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:44:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-17 14:44:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 427. [2025-03-17 14:44:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 309 states have (on average 1.0841423948220066) internal successors, (335), 331 states have internal predecessors, (335), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) [2025-03-17 14:44:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 502 transitions. [2025-03-17 14:44:25,401 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 502 transitions. Word has length 39 [2025-03-17 14:44:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:25,402 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 502 transitions. [2025-03-17 14:44:25,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 502 transitions. [2025-03-17 14:44:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 14:44:25,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:25,402 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:25,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:25,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash -43163833, now seen corresponding path program 2 times [2025-03-17 14:44:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:25,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099323433] [2025-03-17 14:44:25,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:25,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:25,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 14:44:25,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 14:44:25,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099323433] [2025-03-17 14:44:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099323433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822698684] [2025-03-17 14:44:25,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:25,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:25,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:25,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:44:25,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 14:44:25,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 14:44:25,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:25,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:25,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:44:25,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:25,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:25,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822698684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:25,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:25,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 14:44:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396366476] [2025-03-17 14:44:25,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:25,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:44:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:25,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:44:25,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:44:25,872 INFO L87 Difference]: Start difference. First operand 427 states and 502 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:26,161 INFO L93 Difference]: Finished difference Result 486 states and 622 transitions. [2025-03-17 14:44:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 14:44:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2025-03-17 14:44:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:26,163 INFO L225 Difference]: With dead ends: 486 [2025-03-17 14:44:26,163 INFO L226 Difference]: Without dead ends: 485 [2025-03-17 14:44:26,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 14:44:26,164 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:26,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 118 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-17 14:44:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2025-03-17 14:44:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 348 states have (on average 1.0833333333333333) internal successors, (377), 373 states have internal predecessors, (377), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) [2025-03-17 14:44:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 565 transitions. [2025-03-17 14:44:26,188 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 565 transitions. Word has length 40 [2025-03-17 14:44:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:26,188 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 565 transitions. [2025-03-17 14:44:26,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 565 transitions. [2025-03-17 14:44:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 14:44:26,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:26,190 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-03-17 14:44:26,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:44:26,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:44:26,394 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:26,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash 586499953, now seen corresponding path program 3 times [2025-03-17 14:44:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:26,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694304583] [2025-03-17 14:44:26,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:44:26,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:26,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-17 14:44:26,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 14:44:26,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:44:26,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694304583] [2025-03-17 14:44:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694304583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648098450] [2025-03-17 14:44:26,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:44:26,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:26,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:26,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:26,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:44:26,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-17 14:44:26,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 14:44:26,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:44:26,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:26,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 14:44:26,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:26,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648098450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:27,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-17 14:44:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460333834] [2025-03-17 14:44:27,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:44:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:27,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:44:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:44:27,218 INFO L87 Difference]: Start difference. First operand 481 states and 565 transitions. Second operand has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:27,915 INFO L93 Difference]: Finished difference Result 702 states and 907 transitions. [2025-03-17 14:44:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 14:44:27,915 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-17 14:44:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:27,918 INFO L225 Difference]: With dead ends: 702 [2025-03-17 14:44:27,918 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 14:44:27,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-17 14:44:27,919 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 854 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:27,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 417 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:44:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 14:44:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 697. [2025-03-17 14:44:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 504 states have (on average 1.0813492063492063) internal successors, (545), 541 states have internal predecessors, (545), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) [2025-03-17 14:44:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 817 transitions. [2025-03-17 14:44:27,947 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 817 transitions. Word has length 56 [2025-03-17 14:44:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:27,948 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 817 transitions. [2025-03-17 14:44:27,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 817 transitions. [2025-03-17 14:44:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 14:44:27,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:27,952 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:27,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:28,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:44:28,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:28,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1354370442, now seen corresponding path program 3 times [2025-03-17 14:44:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:28,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335829770] [2025-03-17 14:44:28,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:44:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:28,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 9 equivalence classes. [2025-03-17 14:44:28,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 47 of 55 statements. [2025-03-17 14:44:28,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 14:44:28,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:28,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335829770] [2025-03-17 14:44:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335829770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382706146] [2025-03-17 14:44:28,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:44:28,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:28,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:28,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:28,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:44:28,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 9 equivalence classes. [2025-03-17 14:44:28,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 47 of 55 statements. [2025-03-17 14:44:28,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 14:44:28,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:28,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:44:28,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:28,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:28,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382706146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:28,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:28,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-17 14:44:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620147448] [2025-03-17 14:44:28,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:28,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:44:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:28,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:44:28,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:44:28,592 INFO L87 Difference]: Start difference. First operand 697 states and 817 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 16 states have internal predecessors, (61), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:29,368 INFO L93 Difference]: Finished difference Result 810 states and 1039 transitions. [2025-03-17 14:44:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-17 14:44:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 16 states have internal predecessors, (61), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2025-03-17 14:44:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:29,371 INFO L225 Difference]: With dead ends: 810 [2025-03-17 14:44:29,371 INFO L226 Difference]: Without dead ends: 809 [2025-03-17 14:44:29,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1399, Invalid=5081, Unknown=0, NotChecked=0, Total=6480 [2025-03-17 14:44:29,373 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 375 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:29,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 170 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:44:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-17 14:44:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 409. [2025-03-17 14:44:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 306 states have (on average 1.1143790849673203) internal successors, (341), 307 states have internal predecessors, (341), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 14:44:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 477 transitions. [2025-03-17 14:44:29,394 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 477 transitions. Word has length 55 [2025-03-17 14:44:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:29,394 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 477 transitions. [2025-03-17 14:44:29,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 16 states have internal predecessors, (61), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 477 transitions. [2025-03-17 14:44:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 14:44:29,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:29,396 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:29,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:44:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:29,600 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1266671003, now seen corresponding path program 4 times [2025-03-17 14:44:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335106133] [2025-03-17 14:44:29,600 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:44:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:29,603 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-17 14:44:29,611 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 69 statements. [2025-03-17 14:44:29,611 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:44:29,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-17 14:44:29,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:29,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335106133] [2025-03-17 14:44:29,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335106133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:29,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:29,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:44:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939375787] [2025-03-17 14:44:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:29,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:29,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:29,653 INFO L87 Difference]: Start difference. First operand 409 states and 477 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:29,701 INFO L93 Difference]: Finished difference Result 939 states and 1196 transitions. [2025-03-17 14:44:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:29,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 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 69 [2025-03-17 14:44:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:29,703 INFO L225 Difference]: With dead ends: 939 [2025-03-17 14:44:29,703 INFO L226 Difference]: Without dead ends: 642 [2025-03-17 14:44:29,705 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 [2025-03-17 14:44:29,706 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:29,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-17 14:44:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 607. [2025-03-17 14:44:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 439 states have (on average 1.0774487471526195) internal successors, (473), 471 states have internal predecessors, (473), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) [2025-03-17 14:44:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 708 transitions. [2025-03-17 14:44:29,744 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 708 transitions. Word has length 69 [2025-03-17 14:44:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:29,744 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 708 transitions. [2025-03-17 14:44:29,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 708 transitions. [2025-03-17 14:44:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 14:44:29,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:29,746 INFO L218 NwaCegarLoop]: trace histogram [15, 13, 12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:29,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:44:29,746 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:29,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1473326506, now seen corresponding path program 4 times [2025-03-17 14:44:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:29,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842207005] [2025-03-17 14:44:29,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:44:29,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:29,749 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-17 14:44:29,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 14:44:29,754 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:44:29,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842207005] [2025-03-17 14:44:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842207005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053462746] [2025-03-17 14:44:30,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:44:30,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:30,091 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:30,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:44:30,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-17 14:44:30,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 14:44:30,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:44:30,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:30,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 14:44:30,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:30,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:44:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053462746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:30,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2025-03-17 14:44:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938293487] [2025-03-17 14:44:30,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 14:44:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:30,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 14:44:30,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 14:44:30,731 INFO L87 Difference]: Start difference. First operand 607 states and 708 transitions. Second operand has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 28 states have internal predecessors, (109), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:32,664 INFO L93 Difference]: Finished difference Result 826 states and 1018 transitions. [2025-03-17 14:44:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-03-17 14:44:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 28 states have internal predecessors, (109), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-17 14:44:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:32,667 INFO L225 Difference]: With dead ends: 826 [2025-03-17 14:44:32,667 INFO L226 Difference]: Without dead ends: 825 [2025-03-17 14:44:32,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7901 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5809, Invalid=21251, Unknown=0, NotChecked=0, Total=27060 [2025-03-17 14:44:32,673 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 695 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:32,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 240 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:44:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-17 14:44:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 823. [2025-03-17 14:44:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 595 states have (on average 1.0773109243697478) internal successors, (641), 639 states have internal predecessors, (641), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2025-03-17 14:44:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 960 transitions. [2025-03-17 14:44:32,705 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 960 transitions. Word has length 85 [2025-03-17 14:44:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:32,705 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 960 transitions. [2025-03-17 14:44:32,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 28 states have internal predecessors, (109), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 960 transitions. [2025-03-17 14:44:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 14:44:32,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:32,707 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-03-17 14:44:32,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:44:32,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:32,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1113873585, now seen corresponding path program 4 times [2025-03-17 14:44:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010649249] [2025-03-17 14:44:32,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:44:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:32,911 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-17 14:44:32,919 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 14:44:32,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:44:32,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:33,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010649249] [2025-03-17 14:44:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010649249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:33,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292620435] [2025-03-17 14:44:33,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:44:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:33,808 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:33,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:44:33,828 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-17 14:44:33,846 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 14:44:33,847 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:44:33,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:33,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 14:44:33,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:33,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292620435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:35,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-17 14:44:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699276370] [2025-03-17 14:44:35,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:35,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-17 14:44:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:35,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 14:44:35,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:44:35,278 INFO L87 Difference]: Start difference. First operand 823 states and 960 transitions. Second operand has 96 states, 93 states have (on average 1.989247311827957) internal successors, (185), 50 states have internal predecessors, (185), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:37,328 INFO L93 Difference]: Finished difference Result 1258 states and 1558 transitions. [2025-03-17 14:44:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 14:44:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 1.989247311827957) internal successors, (185), 50 states have internal predecessors, (185), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-17 14:44:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:37,335 INFO L225 Difference]: With dead ends: 1258 [2025-03-17 14:44:37,335 INFO L226 Difference]: Without dead ends: 1257 [2025-03-17 14:44:37,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-03-17 14:44:37,338 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2162 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:37,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 800 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:44:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-03-17 14:44:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1255. [2025-03-17 14:44:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 907 states have (on average 1.0771775082690187) internal successors, (977), 975 states have internal predecessors, (977), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) [2025-03-17 14:44:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1464 transitions. [2025-03-17 14:44:37,391 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1464 transitions. Word has length 116 [2025-03-17 14:44:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:37,392 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1464 transitions. [2025-03-17 14:44:37,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 1.989247311827957) internal successors, (185), 50 states have internal predecessors, (185), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1464 transitions. [2025-03-17 14:44:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 14:44:37,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:37,396 INFO L218 NwaCegarLoop]: trace histogram [27, 25, 24, 24, 24, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:37,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:44:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:37,600 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:37,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash 937130518, now seen corresponding path program 5 times [2025-03-17 14:44:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866011179] [2025-03-17 14:44:37,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:44:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:37,605 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 145 statements into 26 equivalence classes. [2025-03-17 14:44:37,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 84 of 145 statements. [2025-03-17 14:44:37,625 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-17 14:44:37,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2025-03-17 14:44:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866011179] [2025-03-17 14:44:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866011179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:44:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367713093] [2025-03-17 14:44:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:37,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:44:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:37,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:44:37,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:37,686 INFO L87 Difference]: Start difference. First operand 1255 states and 1464 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:37,739 INFO L93 Difference]: Finished difference Result 1590 states and 1890 transitions. [2025-03-17 14:44:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:44:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 145 [2025-03-17 14:44:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:37,741 INFO L225 Difference]: With dead ends: 1590 [2025-03-17 14:44:37,741 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 14:44:37,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:44:37,747 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:37,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 14:44:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2025-03-17 14:44:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 189 states have (on average 1.0052910052910053) internal successors, (190), 189 states have internal predecessors, (190), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2025-03-17 14:44:37,755 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 145 [2025-03-17 14:44:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:37,755 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2025-03-17 14:44:37,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2025-03-17 14:44:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-17 14:44:37,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:37,758 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-03-17 14:44:37,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:44:37,758 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash -540383439, now seen corresponding path program 5 times [2025-03-17 14:44:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829098082] [2025-03-17 14:44:37,759 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:44:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:37,765 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-17 14:44:37,852 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 14:44:37,853 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 14:44:37,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829098082] [2025-03-17 14:44:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829098082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439721520] [2025-03-17 14:44:40,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:44:40,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:40,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:40,722 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:40,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:44:40,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-17 14:44:40,841 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 14:44:40,842 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 14:44:40,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:40,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 14:44:40,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:41,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439721520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:45,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:45,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-17 14:44:45,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80273837] [2025-03-17 14:44:45,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:45,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-17 14:44:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:45,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-17 14:44:45,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 14:44:45,864 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:50,593 INFO L93 Difference]: Finished difference Result 480 states and 527 transitions. [2025-03-17 14:44:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-17 14:44:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2025-03-17 14:44:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:50,595 INFO L225 Difference]: With dead ends: 480 [2025-03-17 14:44:50,595 INFO L226 Difference]: Without dead ends: 479 [2025-03-17 14:44:50,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-03-17 14:44:50,601 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1781 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:50,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1781 Valid, 36 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:44:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-17 14:44:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2025-03-17 14:44:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 381 states have (on average 1.0026246719160106) internal successors, (382), 381 states have internal predecessors, (382), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2025-03-17 14:44:50,614 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 236 [2025-03-17 14:44:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:50,614 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 477 transitions. [2025-03-17 14:44:50,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 477 transitions. [2025-03-17 14:44:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-17 14:44:50,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:50,618 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1, 1] [2025-03-17 14:44:50,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:44:50,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 14:44:50,819 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:44:50,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash 24509489, now seen corresponding path program 6 times [2025-03-17 14:44:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:50,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656668457] [2025-03-17 14:44:50,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:44:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:50,828 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-03-17 14:44:50,961 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-03-17 14:44:50,961 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 14:44:50,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:45:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:45:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:45:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656668457] [2025-03-17 14:45:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656668457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:45:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403588400] [2025-03-17 14:45:02,646 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:45:02,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:45:02,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:45:02,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:45:02,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:45:02,683 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-03-17 14:45:02,900 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-03-17 14:45:02,900 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 14:45:02,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:45:02,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-17 14:45:02,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:45:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:45:03,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:45:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:45:22,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403588400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:45:22,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:45:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-03-17 14:45:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274071760] [2025-03-17 14:45:22,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:45:22,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-17 14:45:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:45:22,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-17 14:45:22,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-03-17 14:45:22,159 INFO L87 Difference]: Start difference. First operand 477 states and 477 transitions. Second operand has 384 states, 381 states have (on average 1.9973753280839894) internal successors, (761), 194 states have internal predecessors, (761), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:45:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:45:52,095 INFO L93 Difference]: Finished difference Result 960 states and 1055 transitions. [2025-03-17 14:45:52,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-03-17 14:45:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 381 states have (on average 1.9973753280839894) internal successors, (761), 194 states have internal predecessors, (761), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2025-03-17 14:45:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:45:52,099 INFO L225 Difference]: With dead ends: 960 [2025-03-17 14:45:52,100 INFO L226 Difference]: Without dead ends: 959 [2025-03-17 14:45:52,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1332 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71820 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=91301, Invalid=237601, Unknown=0, NotChecked=0, Total=328902 [2025-03-17 14:45:52,118 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3489 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3489 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 14:45:52,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 36 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 14:45:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-17 14:45:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 957. [2025-03-17 14:45:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 765 states have (on average 1.0013071895424837) internal successors, (766), 765 states have internal predecessors, (766), 191 states have call successors, (191), 191 states have call predecessors, (191), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:45:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 957 transitions. [2025-03-17 14:45:52,146 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 957 transitions. Word has length 476 [2025-03-17 14:45:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:45:52,146 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 957 transitions. [2025-03-17 14:45:52,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 381 states have (on average 1.9973753280839894) internal successors, (761), 194 states have internal predecessors, (761), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:45:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 957 transitions. [2025-03-17 14:45:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2025-03-17 14:45:52,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:45:52,160 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 1, 1, 1, 1] [2025-03-17 14:45:52,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:45:52,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 14:45:52,361 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:45:52,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:45:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2041895375, now seen corresponding path program 7 times [2025-03-17 14:45:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:45:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610533828] [2025-03-17 14:45:52,362 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:45:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:45:52,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 956 statements into 1 equivalence classes. [2025-03-17 14:45:52,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 956 of 956 statements. [2025-03-17 14:45:52,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:45:52,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat