./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:30:06,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:30:06,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:30:06,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:30:06,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:30:06,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:30:06,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:30:06,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:30:06,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:30:06,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:30:06,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:30:06,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:30:06,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:30:06,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:30:06,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:30:06,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:30:06,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:30:06,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:30:06,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:30:06,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:30:06,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:30:06,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:30:06,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:30:06,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:06,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:30:06,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:30:06,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:30:06,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:30:06,801 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 [2025-03-04 11:30:07,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:30:07,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:30:07,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:30:07,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:30:07,015 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:30:07,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2025-03-04 11:30:08,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555c47ddb/84e98c8dfb6a481e85dbe117b45c613d/FLAGb45c2e420 [2025-03-04 11:30:08,346 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:30:08,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2025-03-04 11:30:08,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555c47ddb/84e98c8dfb6a481e85dbe117b45c613d/FLAGb45c2e420 [2025-03-04 11:30:08,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555c47ddb/84e98c8dfb6a481e85dbe117b45c613d [2025-03-04 11:30:08,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:30:08,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:30:08,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:08,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:30:08,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:30:08,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644b0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08, skipping insertion in model container [2025-03-04 11:30:08,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:30:08,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:08,506 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:30:08,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:08,527 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:30:08,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08 WrapperNode [2025-03-04 11:30:08,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:08,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:08,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:30:08,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:30:08,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,550 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-03-04 11:30:08,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:08,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:30:08,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:30:08,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:30:08,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:30:08,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:30:08,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:30:08,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:30:08,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:30:08,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (1/1) ... [2025-03-04 11:30:08,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:08,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:08,604 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-04 11:30:08,607 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-04 11:30:08,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:30:08,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:30:08,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:30:08,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:30:08,626 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-04 11:30:08,626 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-04 11:30:08,666 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:30:08,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:30:08,734 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-03-04 11:30:08,739 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 11:30:08,740 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:30:08,748 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:30:08,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:30:08,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:08 BoogieIcfgContainer [2025-03-04 11:30:08,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:30:08,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:30:08,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:30:08,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:30:08,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:30:08" (1/3) ... [2025-03-04 11:30:08,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674508a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:08, skipping insertion in model container [2025-03-04 11:30:08,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:08" (2/3) ... [2025-03-04 11:30:08,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674508a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:08, skipping insertion in model container [2025-03-04 11:30:08,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:08" (3/3) ... [2025-03-04 11:30:08,756 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2025-03-04 11:30:08,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:30:08,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i15_o15-2.c that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 11:30:08,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:30:08,808 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;@14bba914, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:30:08,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 11:30:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:30:08,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:08,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:30:08,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1123769116, now seen corresponding path program 1 times [2025-03-04 11:30:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148878046] [2025-03-04 11:30:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:08,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:08,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:30:08,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:30:08,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:08,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:08,973 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-04 11:30:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148878046] [2025-03-04 11:30:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148878046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:08,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011460903] [2025-03-04 11:30:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:08,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:08,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:08,989 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-04 11:30:09,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:09,039 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-03-04 11:30:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:09,040 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-04 11:30:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:09,043 INFO L225 Difference]: With dead ends: 46 [2025-03-04 11:30:09,043 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 11:30:09,045 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-04 11:30:09,047 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:09,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 69 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 11:30:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-04 11:30:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-04 11:30:09,071 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2025-03-04 11:30:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:09,071 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-04 11:30:09,071 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-04 11:30:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-04 11:30:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:30:09,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:09,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:09,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:30:09,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:09,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash -638284688, now seen corresponding path program 1 times [2025-03-04 11:30:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:09,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816689849] [2025-03-04 11:30:09,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:09,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:09,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:09,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:09,166 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-04 11:30:09,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816689849] [2025-03-04 11:30:09,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816689849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:09,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797959084] [2025-03-04 11:30:09,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:09,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:09,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:09,169 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-04 11:30:09,171 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-04 11:30:09,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:09,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:09,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:09,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:09,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:09,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:09,282 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-04 11:30:09,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:09,359 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-04 11:30:09,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797959084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:09,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 11:30:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644277881] [2025-03-04 11:30:09,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:09,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:30:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:09,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:30:09,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:30:09,362 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 15 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:09,492 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2025-03-04 11:30:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:30:09,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 11:30:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:09,494 INFO L225 Difference]: With dead ends: 80 [2025-03-04 11:30:09,495 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 11:30:09,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:30:09,496 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 120 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:09,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 101 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 11:30:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2025-03-04 11:30:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 44 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:30:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-03-04 11:30:09,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 11 [2025-03-04 11:30:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:09,505 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-04 11:30:09,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-03-04 11:30:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:30:09,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:09,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:09,512 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-04 11:30:09,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:09,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:09,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1688011139, now seen corresponding path program 1 times [2025-03-04 11:30:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:09,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226299812] [2025-03-04 11:30:09,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:09,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:30:09,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:30:09,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:09,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226299812] [2025-03-04 11:30:09,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226299812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204299746] [2025-03-04 11:30:09,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:09,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:09,794 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-04 11:30:09,795 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-04 11:30:09,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:30:09,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:30:09,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:09,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:09,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:09,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:09,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:30:09,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204299746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:09,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:30:09,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-04 11:30:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208425769] [2025-03-04 11:30:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:09,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:30:09,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:09,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:30:09,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:30:09,867 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:09,927 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-03-04 11:30:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:30:09,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 11:30:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:09,931 INFO L225 Difference]: With dead ends: 63 [2025-03-04 11:30:09,931 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 11:30:09,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:09,931 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:09,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 11:30:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-03-04 11:30:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:30:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-04 11:30:09,940 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 12 [2025-03-04 11:30:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:09,940 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-04 11:30:09,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-04 11:30:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:30:09,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:09,941 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:09,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:10,141 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,SelfDestructingSolverStorable2 [2025-03-04 11:30:10,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:10,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:10,142 INFO L85 PathProgramCache]: Analyzing trace with hash -16539686, now seen corresponding path program 1 times [2025-03-04 11:30:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:10,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542668259] [2025-03-04 11:30:10,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:10,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:30:10,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:30:10,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:10,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:30:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542668259] [2025-03-04 11:30:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542668259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:10,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:30:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097997007] [2025-03-04 11:30:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:30:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:10,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:30:10,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:30:10,196 INFO L87 Difference]: Start difference. First operand 54 states and 65 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-04 11:30:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:10,223 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2025-03-04 11:30:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:30:10,225 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 19 [2025-03-04 11:30:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:10,226 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:30:10,226 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 11:30:10,226 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-04 11:30:10,227 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:10,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 11:30:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 11:30:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:30:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-03-04 11:30:10,241 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19 [2025-03-04 11:30:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:10,241 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-03-04 11:30:10,242 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-04 11:30:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-03-04 11:30:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:30:10,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:10,243 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:10,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:30:10,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:10,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1336297931, now seen corresponding path program 1 times [2025-03-04 11:30:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:10,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221234651] [2025-03-04 11:30:10,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:10,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:30:10,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:30:10,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:10,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:30:10,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221234651] [2025-03-04 11:30:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221234651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:10,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:10,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:30:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817983421] [2025-03-04 11:30:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:10,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:30:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:10,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:30:10,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:30:10,276 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-04 11:30:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:10,285 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-03-04 11:30:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:30:10,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 24 [2025-03-04 11:30:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:10,289 INFO L225 Difference]: With dead ends: 72 [2025-03-04 11:30:10,289 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 11:30:10,289 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-04 11:30:10,289 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 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-04 11:30:10,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 11:30:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 11:30:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:30:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-04 11:30:10,304 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 24 [2025-03-04 11:30:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:10,305 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-04 11:30:10,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-04 11:30:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-03-04 11:30:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:30:10,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:10,306 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 11:30:10,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:30:10,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:10,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -543218660, now seen corresponding path program 2 times [2025-03-04 11:30:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294098174] [2025-03-04 11:30:10,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:10,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:10,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:30:10,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:10,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:10,446 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-04 11:30:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294098174] [2025-03-04 11:30:10,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294098174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218765199] [2025-03-04 11:30:10,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:10,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:10,449 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-04 11:30:10,454 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-04 11:30:10,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:10,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:30:10,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:10,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:10,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:30:10,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:10,559 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-04 11:30:10,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:10,736 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-04 11:30:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218765199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:10,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:10,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-04 11:30:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778679262] [2025-03-04 11:30:10,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:10,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:30:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:10,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:30:10,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:30:10,738 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 27 states, 23 states have (on average 2.0) internal successors, (46), 16 states have internal predecessors, (46), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:11,007 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2025-03-04 11:30:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:30:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.0) internal successors, (46), 16 states have internal predecessors, (46), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 11:30:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:11,009 INFO L225 Difference]: With dead ends: 188 [2025-03-04 11:30:11,009 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:30:11,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 11:30:11,010 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 286 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:11,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 239 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:30:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2025-03-04 11:30:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 116 states have (on average 1.146551724137931) internal successors, (133), 116 states have internal predecessors, (133), 12 states have call successors, (12), 11 states have call predecessors, (12), 16 states have return successors, (18), 18 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-04 11:30:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2025-03-04 11:30:11,030 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 26 [2025-03-04 11:30:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:11,030 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2025-03-04 11:30:11,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.0) internal successors, (46), 16 states have internal predecessors, (46), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2025-03-04 11:30:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:30:11,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:11,031 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:11,037 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-04 11:30:11,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:11,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -98645244, now seen corresponding path program 1 times [2025-03-04 11:30:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345908111] [2025-03-04 11:30:11,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:11,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:11,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:11,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:11,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:11,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:11,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345908111] [2025-03-04 11:30:11,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345908111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:11,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948549691] [2025-03-04 11:30:11,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:11,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:11,296 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-04 11:30:11,298 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-04 11:30:11,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:11,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:11,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:11,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:11,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:30:11,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:30:11,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:30:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948549691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:11,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 15] total 29 [2025-03-04 11:30:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33541386] [2025-03-04 11:30:11,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:30:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:11,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:30:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:30:11,757 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 21 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:30:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:12,111 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2025-03-04 11:30:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:30:12,112 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 21 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-03-04 11:30:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:12,113 INFO L225 Difference]: With dead ends: 208 [2025-03-04 11:30:12,113 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 11:30:12,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:30:12,114 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 160 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:12,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 430 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:30:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 11:30:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-03-04 11:30:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.1121495327102804) internal successors, (119), 106 states have internal predecessors, (119), 12 states have call successors, (12), 11 states have call predecessors, (12), 13 states have return successors, (16), 16 states have call predecessors, (16), 11 states have call successors, (16) [2025-03-04 11:30:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2025-03-04 11:30:12,125 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 40 [2025-03-04 11:30:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:12,125 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2025-03-04 11:30:12,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 21 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:30:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2025-03-04 11:30:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:30:12,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:12,126 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 11:30:12,132 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-04 11:30:12,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:12,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:12,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1018977892, now seen corresponding path program 3 times [2025-03-04 11:30:12,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:12,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444682907] [2025-03-04 11:30:12,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:12,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:12,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:30:12,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:12,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:12,720 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-04 11:30:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444682907] [2025-03-04 11:30:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444682907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744976522] [2025-03-04 11:30:12,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:12,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:12,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:12,723 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-04 11:30:12,725 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-04 11:30:12,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:12,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:30:12,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:12,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:12,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:30:12,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:12,858 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-04 11:30:12,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:13,358 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-04 11:30:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744976522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:13,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:13,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 50 [2025-03-04 11:30:13,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167748714] [2025-03-04 11:30:13,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:13,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 11:30:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:13,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 11:30:13,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=1942, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 11:30:13,362 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand has 51 states, 47 states have (on average 2.0) internal successors, (94), 28 states have internal predecessors, (94), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:14,024 INFO L93 Difference]: Finished difference Result 438 states and 470 transitions. [2025-03-04 11:30:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 11:30:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 2.0) internal successors, (94), 28 states have internal predecessors, (94), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-04 11:30:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:14,027 INFO L225 Difference]: With dead ends: 438 [2025-03-04 11:30:14,027 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 11:30:14,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1391, Invalid=3865, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 11:30:14,030 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 771 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:14,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 556 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:30:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 11:30:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 364. [2025-03-04 11:30:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 291 states have (on average 1.120274914089347) internal successors, (326), 290 states have internal predecessors, (326), 24 states have call successors, (24), 23 states have call predecessors, (24), 47 states have return successors, (50), 50 states have call predecessors, (50), 23 states have call successors, (50) [2025-03-04 11:30:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2025-03-04 11:30:14,063 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 56 [2025-03-04 11:30:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:14,063 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2025-03-04 11:30:14,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 2.0) internal successors, (94), 28 states have internal predecessors, (94), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2025-03-04 11:30:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:30:14,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:14,065 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 11:30:14,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:14,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:14,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:14,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2136562119, now seen corresponding path program 2 times [2025-03-04 11:30:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293596559] [2025-03-04 11:30:14,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:14,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:14,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:30:14,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:30:14,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:14,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 299 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:30:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293596559] [2025-03-04 11:30:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293596559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639454588] [2025-03-04 11:30:14,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:14,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:14,658 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-04 11:30:14,659 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-04 11:30:14,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:30:14,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:30:14,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:14,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:30:14,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 297 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:30:14,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 303 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:30:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639454588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:15,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 27] total 40 [2025-03-04 11:30:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396629391] [2025-03-04 11:30:15,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 11:30:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 11:30:15,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 11:30:15,273 INFO L87 Difference]: Start difference. First operand 364 states and 400 transitions. Second operand has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 27 states have internal predecessors, (86), 19 states have call successors, (20), 14 states have call predecessors, (20), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:30:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,641 INFO L93 Difference]: Finished difference Result 457 states and 492 transitions. [2025-03-04 11:30:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 11:30:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 27 states have internal predecessors, (86), 19 states have call successors, (20), 14 states have call predecessors, (20), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 75 [2025-03-04 11:30:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,644 INFO L225 Difference]: With dead ends: 457 [2025-03-04 11:30:15,644 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 11:30:15,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 122 SyntacticMatches, 15 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=644, Invalid=2326, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:30:15,646 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 325 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:15,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 497 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 11:30:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 324. [2025-03-04 11:30:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 259 states have (on average 1.1196911196911197) internal successors, (290), 258 states have internal predecessors, (290), 24 states have call successors, (24), 23 states have call predecessors, (24), 39 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) [2025-03-04 11:30:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 356 transitions. [2025-03-04 11:30:15,662 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 356 transitions. Word has length 75 [2025-03-04 11:30:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,663 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 356 transitions. [2025-03-04 11:30:15,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 27 states have internal predecessors, (86), 19 states have call successors, (20), 14 states have call predecessors, (20), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:30:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 356 transitions. [2025-03-04 11:30:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:30:15,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,666 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 11:30:15,673 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-04 11:30:15,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:15,867 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:15,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash 343093447, now seen corresponding path program 3 times [2025-03-04 11:30:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279620834] [2025-03-04 11:30:15,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 16 equivalence classes. [2025-03-04 11:30:15,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 95 statements. [2025-03-04 11:30:15,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:30:15,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279620834] [2025-03-04 11:30:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279620834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879779374] [2025-03-04 11:30:15,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:15,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:15,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:15,959 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-04 11:30:15,961 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-04 11:30:15,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 16 equivalence classes. [2025-03-04 11:30:15,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 95 statements. [2025-03-04 11:30:15,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:30:15,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:30:15,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:16,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:16,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879779374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:16,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:16,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 11:30:16,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885818965] [2025-03-04 11:30:16,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:16,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:30:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:16,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:30:16,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:30:16,159 INFO L87 Difference]: Start difference. First operand 324 states and 356 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:30:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:16,228 INFO L93 Difference]: Finished difference Result 567 states and 652 transitions. [2025-03-04 11:30:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:30:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 95 [2025-03-04 11:30:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:16,232 INFO L225 Difference]: With dead ends: 567 [2025-03-04 11:30:16,232 INFO L226 Difference]: Without dead ends: 566 [2025-03-04 11:30:16,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:30:16,234 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:16,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-04 11:30:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-04 11:30:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 455 states have (on average 1.0681318681318681) internal successors, (486), 450 states have internal predecessors, (486), 24 states have call successors, (24), 23 states have call predecessors, (24), 85 states have return successors, (92), 92 states have call predecessors, (92), 23 states have call successors, (92) [2025-03-04 11:30:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 602 transitions. [2025-03-04 11:30:16,267 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 602 transitions. Word has length 95 [2025-03-04 11:30:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:16,267 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 602 transitions. [2025-03-04 11:30:16,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:30:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 602 transitions. [2025-03-04 11:30:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 11:30:16,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:16,269 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-03-04 11:30:16,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:16,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:16,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:16,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1377387364, now seen corresponding path program 4 times [2025-03-04 11:30:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925724821] [2025-03-04 11:30:16,470 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:16,474 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 11:30:16,485 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:30:16,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,375 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-04 11:30:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925724821] [2025-03-04 11:30:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925724821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706603766] [2025-03-04 11:30:17,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:17,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:17,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:17,379 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-04 11:30:17,379 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-04 11:30:17,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 11:30:17,423 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:30:17,423 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 11:30:17,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:17,577 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-04 11:30:17,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:18,930 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-04 11:30:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706603766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:18,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:18,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 98 [2025-03-04 11:30:18,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218771753] [2025-03-04 11:30:18,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:18,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2025-03-04 11:30:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:18,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2025-03-04 11:30:18,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=7342, Unknown=0, NotChecked=0, Total=9702 [2025-03-04 11:30:18,934 INFO L87 Difference]: Start difference. First operand 566 states and 602 transitions. Second operand has 99 states, 95 states have (on average 2.0) internal successors, (190), 52 states have internal predecessors, (190), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:19,333 INFO L93 Difference]: Finished difference Result 581 states and 602 transitions. [2025-03-04 11:30:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 11:30:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 95 states have (on average 2.0) internal successors, (190), 52 states have internal predecessors, (190), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-04 11:30:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:19,336 INFO L225 Difference]: With dead ends: 581 [2025-03-04 11:30:19,337 INFO L226 Difference]: Without dead ends: 580 [2025-03-04 11:30:19,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3218 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3827, Invalid=9513, Unknown=0, NotChecked=0, Total=13340 [2025-03-04 11:30:19,340 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 490 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:19,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 668 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:30:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-04 11:30:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 565. [2025-03-04 11:30:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 455 states have (on average 1.065934065934066) internal successors, (485), 449 states have internal predecessors, (485), 24 states have call successors, (24), 23 states have call predecessors, (24), 85 states have return successors, (92), 92 states have call predecessors, (92), 23 states have call successors, (92) [2025-03-04 11:30:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 601 transitions. [2025-03-04 11:30:19,366 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 601 transitions. Word has length 116 [2025-03-04 11:30:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:19,366 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 601 transitions. [2025-03-04 11:30:19,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 95 states have (on average 2.0) internal successors, (190), 52 states have internal predecessors, (190), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 601 transitions. [2025-03-04 11:30:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 11:30:19,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:19,368 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2025-03-04 11:30:19,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:30:19,572 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,SelfDestructingSolverStorable10 [2025-03-04 11:30:19,572 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:19,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 709442823, now seen corresponding path program 4 times [2025-03-04 11:30:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298775175] [2025-03-04 11:30:19,573 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:19,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-04 11:30:19,581 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 11:30:19,582 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:19,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:19,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298775175] [2025-03-04 11:30:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298775175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986694598] [2025-03-04 11:30:19,802 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:19,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:19,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:19,804 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-04 11:30:19,806 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-04 11:30:19,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-04 11:30:19,849 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 11:30:19,850 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:19,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:19,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:30:19,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:19,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986694598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:20,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:20,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-04 11:30:20,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776897873] [2025-03-04 11:30:20,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:20,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:30:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:20,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:30:20,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:30:20,888 INFO L87 Difference]: Start difference. First operand 565 states and 601 transitions. Second operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 11:30:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:20,973 INFO L93 Difference]: Finished difference Result 1290 states and 1481 transitions. [2025-03-04 11:30:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:30:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2025-03-04 11:30:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:20,977 INFO L225 Difference]: With dead ends: 1290 [2025-03-04 11:30:20,978 INFO L226 Difference]: Without dead ends: 1289 [2025-03-04 11:30:20,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:30:20,980 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:20,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-03-04 11:30:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-03-04 11:30:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1039 states have (on average 1.0288739172281038) internal successors, (1069), 1025 states have internal predecessors, (1069), 24 states have call successors, (24), 23 states have call predecessors, (24), 225 states have return successors, (240), 240 states have call predecessors, (240), 23 states have call successors, (240) [2025-03-04 11:30:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1333 transitions. [2025-03-04 11:30:21,029 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1333 transitions. Word has length 115 [2025-03-04 11:30:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:21,030 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1333 transitions. [2025-03-04 11:30:21,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 11:30:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1333 transitions. [2025-03-04 11:30:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 11:30:21,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:21,032 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1] [2025-03-04 11:30:21,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:21,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:21,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:21,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash -54299257, now seen corresponding path program 5 times [2025-03-04 11:30:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903287792] [2025-03-04 11:30:21,237 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:21,242 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 155 statements into 16 equivalence classes. [2025-03-04 11:30:21,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 11:30:21,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 11:30:21,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:21,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:21,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903287792] [2025-03-04 11:30:21,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903287792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:21,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745385124] [2025-03-04 11:30:21,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:21,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:21,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:21,694 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-04 11:30:21,696 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-04 11:30:21,732 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 155 statements into 16 equivalence classes. [2025-03-04 11:30:21,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 11:30:21,762 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 11:30:21,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:21,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 11:30:21,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:21,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-04 11:30:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745385124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:30,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2025-03-04 11:30:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607516784] [2025-03-04 11:30:30,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:30,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 11:30:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:30,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 11:30:30,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:30:30,254 INFO L87 Difference]: Start difference. First operand 1289 states and 1333 transitions. Second operand has 62 states, 61 states have (on average 2.098360655737705) internal successors, (128), 62 states have internal predecessors, (128), 1 states have call successors, (2), 1 states have call predecessors, (2), 30 states have return successors, (30), 30 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-04 11:30:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:30,469 INFO L93 Difference]: Finished difference Result 3098 states and 3509 transitions. [2025-03-04 11:30:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 11:30:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.098360655737705) internal successors, (128), 62 states have internal predecessors, (128), 1 states have call successors, (2), 1 states have call predecessors, (2), 30 states have return successors, (30), 30 states have call predecessors, (30), 1 states have call successors, (30) Word has length 155 [2025-03-04 11:30:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:30,475 INFO L225 Difference]: With dead ends: 3098 [2025-03-04 11:30:30,476 INFO L226 Difference]: Without dead ends: 1495 [2025-03-04 11:30:30,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:30:30,481 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:30,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2025-03-04 11:30:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2025-03-04 11:30:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1208 states have (on average 1.0190397350993377) internal successors, (1231), 1187 states have internal predecessors, (1231), 24 states have call successors, (24), 23 states have call predecessors, (24), 262 states have return successors, (284), 284 states have call predecessors, (284), 23 states have call successors, (284) [2025-03-04 11:30:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1539 transitions. [2025-03-04 11:30:30,539 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1539 transitions. Word has length 155 [2025-03-04 11:30:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:30,539 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 1539 transitions. [2025-03-04 11:30:30,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.098360655737705) internal successors, (128), 62 states have internal predecessors, (128), 1 states have call successors, (2), 1 states have call predecessors, (2), 30 states have return successors, (30), 30 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-04 11:30:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1539 transitions. [2025-03-04 11:30:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-04 11:30:30,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:30,546 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1] [2025-03-04 11:30:30,553 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-04 11:30:30,751 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,SelfDestructingSolverStorable12 [2025-03-04 11:30:30,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -67190137, now seen corresponding path program 6 times [2025-03-04 11:30:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443111147] [2025-03-04 11:30:30,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:30:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:30,763 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 315 statements into 32 equivalence classes. [2025-03-04 11:30:30,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 11:30:30,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2025-03-04 11:30:30,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4712 backedges. 0 proven. 2325 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2025-03-04 11:30:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443111147] [2025-03-04 11:30:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443111147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485967582] [2025-03-04 11:30:32,318 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:30:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:32,320 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-04 11:30:32,321 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-04 11:30:32,466 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 315 statements into 32 equivalence classes. [2025-03-04 11:30:32,527 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 11:30:32,528 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2025-03-04 11:30:32,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:32,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 11:30:32,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4712 backedges. 2325 proven. 152 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2025-03-04 11:30:33,617 INFO L312 TraceCheckSpWp]: Computing backward predicates...