./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse.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 a3ce8ed9b11c6a489417f826d9219817658abedf9275fa7096a6b8defde228eb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:01:57,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:01:57,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:01:57,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:01:57,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:01:57,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:01:57,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:01:57,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:01:57,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:01:57,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:01:57,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:01:57,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:01:57,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:01:57,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:01:57,931 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:01:57,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:01:57,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:01:57,933 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:01:57,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:01:57,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:01:57,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:01:57,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:01:57,933 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:01:57,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:01:57,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:57,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:57,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:01:57,934 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:01:57,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:01:57,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:01:57,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:01:57,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:01:57,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:01:57,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:01:57,935 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 -> a3ce8ed9b11c6a489417f826d9219817658abedf9275fa7096a6b8defde228eb [2025-04-29 11:01:58,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:01:58,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:01:58,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:01:58,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:01:58,173 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:01:58,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse.c [2025-04-29 11:01:59,461 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd2bc252/5f79dc4c60f347f498cf3d90fb819d9f/FLAG685ec748a [2025-04-29 11:01:59,663 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:01:59,664 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all_reverse.c [2025-04-29 11:01:59,665 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:59,665 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:59,670 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd2bc252/5f79dc4c60f347f498cf3d90fb819d9f/FLAG685ec748a [2025-04-29 11:02:00,462 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd2bc252/5f79dc4c60f347f498cf3d90fb819d9f [2025-04-29 11:02:00,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:02:00,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:02:00,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:00,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:02:00,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:02:00,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1ae11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00, skipping insertion in model container [2025-04-29 11:02:00,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:02:00,645 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:00,654 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:02:00,690 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:00,703 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:02:00,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00 WrapperNode [2025-04-29 11:02:00,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:00,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:00,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:02:00,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:02:00,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,735 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-04-29 11:02:00,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:00,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:02:00,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:02:00,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:02:00,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,771 INFO L175 MemorySlicer]: Split 9 memory accesses to 1 slices as follows [9]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2025-04-29 11:02:00,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:02:00,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:02:00,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:02:00,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:02:00,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (1/1) ... [2025-04-29 11:02:00,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:00,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:00,820 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-04-29 11:02:00,822 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-04-29 11:02:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:02:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:02:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:02:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:02:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-29 11:02:00,839 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-29 11:02:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:02:00,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:02:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:02:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:02:00,892 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:02:00,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:02:00,914 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-29 11:02:01,070 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2025-04-29 11:02:01,071 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:02:01,077 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:02:01,077 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:02:01,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:01 BoogieIcfgContainer [2025-04-29 11:02:01,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:02:01,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:02:01,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:02:01,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:02:01,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:02:00" (1/3) ... [2025-04-29 11:02:01,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e19d83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:01, skipping insertion in model container [2025-04-29 11:02:01,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:00" (2/3) ... [2025-04-29 11:02:01,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e19d83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:01, skipping insertion in model container [2025-04-29 11:02:01,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:01" (3/3) ... [2025-04-29 11:02:01,085 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.c [2025-04-29 11:02:01,094 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:02:01,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_update_all_reverse.c that has 2 procedures, 62 locations, 71 edges, 1 initial locations, 6 loop locations, and 18 error locations. [2025-04-29 11:02:01,130 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:02:01,140 INFO L340 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;@1d48ca11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:02:01,140 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-04-29 11:02:01,142 INFO L278 IsEmpty]: Start isEmpty. Operand has 61 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 59 states have internal predecessors, (68), 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-04-29 11:02:01,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:02:01,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:01,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:02:01,147 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:01,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:01,151 INFO L85 PathProgramCache]: Analyzing trace with hash 33487134, now seen corresponding path program 1 times [2025-04-29 11:02:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:01,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779055461] [2025-04-29 11:02:01,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:01,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:02:01,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:02:01,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:01,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:01,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:01,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779055461] [2025-04-29 11:02:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779055461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:01,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:01,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400178316] [2025-04-29 11:02:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:01,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:01,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:01,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:01,319 INFO L87 Difference]: Start difference. First operand has 61 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 59 states have internal predecessors, (68), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:01,345 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-04-29 11:02:01,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:01,347 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:02:01,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:01,351 INFO L225 Difference]: With dead ends: 113 [2025-04-29 11:02:01,351 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:02:01,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-04-29 11:02:01,354 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:01,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:02:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2025-04-29 11:02:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-04-29 11:02:01,381 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 5 [2025-04-29 11:02:01,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:01,382 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-04-29 11:02:01,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,382 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-04-29 11:02:01,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:02:01,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:01,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:01,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:02:01,383 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:01,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash 565429613, now seen corresponding path program 1 times [2025-04-29 11:02:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:01,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340287774] [2025-04-29 11:02:01,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:01,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:02:01,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:02:01,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:01,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:01,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:01,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340287774] [2025-04-29 11:02:01,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340287774] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638354757] [2025-04-29 11:02:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:01,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:01,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:01,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:01,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:01,475 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:01,500 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2025-04-29 11:02:01,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:01,501 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 11:02:01,501 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:01,501 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:02:01,502 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:02:01,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-04-29 11:02:01,504 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:01,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:02:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-29 11:02:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-04-29 11:02:01,508 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 8 [2025-04-29 11:02:01,508 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:01,508 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-04-29 11:02:01,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,508 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-04-29 11:02:01,509 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:02:01,509 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:01,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:01,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:02:01,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:01,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash 565431535, now seen corresponding path program 1 times [2025-04-29 11:02:01,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:01,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201952831] [2025-04-29 11:02:01,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:01,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:01,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:02:01,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:02:01,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:01,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:01,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:01,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201952831] [2025-04-29 11:02:01,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201952831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:01,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:01,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:01,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229893614] [2025-04-29 11:02:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:01,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:01,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:01,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:01,621 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:01,651 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-04-29 11:02:01,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:01,651 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 11:02:01,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:01,652 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:02:01,652 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:02:01,652 INFO L436 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-04-29 11:02:01,652 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:01,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:02:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-04-29 11:02:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-04-29 11:02:01,659 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 8 [2025-04-29 11:02:01,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:01,660 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-04-29 11:02:01,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,660 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-04-29 11:02:01,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:02:01,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:01,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:01,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:02:01,660 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:01,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash 348508461, now seen corresponding path program 1 times [2025-04-29 11:02:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:01,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499735675] [2025-04-29 11:02:01,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:01,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:02:01,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:02:01,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:01,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:01,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:01,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499735675] [2025-04-29 11:02:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499735675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:01,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400620332] [2025-04-29 11:02:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:01,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:01,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:01,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:01,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:01,736 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:01,763 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-04-29 11:02:01,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:01,763 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:02:01,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:01,764 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:02:01,764 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:02:01,764 INFO L436 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-04-29 11:02:01,765 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:01,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:02:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-04-29 11:02:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.575) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-04-29 11:02:01,768 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 9 [2025-04-29 11:02:01,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:01,768 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-04-29 11:02:01,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,768 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-04-29 11:02:01,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:02:01,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:01,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:01,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:02:01,769 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:01,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1479668851, now seen corresponding path program 1 times [2025-04-29 11:02:01,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:01,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113153431] [2025-04-29 11:02:01,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:01,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:02:01,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:02:01,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:01,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:01,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113153431] [2025-04-29 11:02:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113153431] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:01,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13858148] [2025-04-29 11:02:01,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:01,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:01,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:01,839 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-04-29 11:02:01,840 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-04-29 11:02:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:02:01,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:02:01,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:01,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:01,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:02:01,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:02:01,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13858148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:02:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287576692] [2025-04-29 11:02:01,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:01,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:01,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:01,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:01,933 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:01,952 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-04-29 11:02:01,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:01,953 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:02:01,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:01,953 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:02:01,953 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:02:01,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:01,954 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 37 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:01,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 41 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:02:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 11:02:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.525) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-04-29 11:02:01,962 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 12 [2025-04-29 11:02:01,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:01,962 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-04-29 11:02:01,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:01,962 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-04-29 11:02:01,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:02:01,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:01,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:01,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:02:02,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:02,165 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:02,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:02,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1374905807, now seen corresponding path program 1 times [2025-04-29 11:02:02,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:02,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931964060] [2025-04-29 11:02:02,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:02,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:02:02,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:02:02,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:02,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:02,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931964060] [2025-04-29 11:02:02,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931964060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:02,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116351056] [2025-04-29 11:02:02,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:02,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:02,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:02,230 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-04-29 11:02:02,232 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-04-29 11:02:02,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:02:02,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:02:02,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:02,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:02,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:02:02,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:02:02,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116351056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:02,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:02,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:02:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102520712] [2025-04-29 11:02:02,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:02,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:02,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:02,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:02,304 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:02,321 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-04-29 11:02:02,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:02,322 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:02:02,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:02,322 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:02:02,322 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:02:02,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:02,323 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:02,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:02:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 11:02:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-04-29 11:02:02,327 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2025-04-29 11:02:02,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:02,327 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-04-29 11:02:02,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:02,327 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-04-29 11:02:02,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:02:02,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:02,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:02,336 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-04-29 11:02:02,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 11:02:02,528 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:02,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1565448947, now seen corresponding path program 1 times [2025-04-29 11:02:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:02,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956982510] [2025-04-29 11:02:02,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:02,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:02:02,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:02:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:02,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956982510] [2025-04-29 11:02:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956982510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:02,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110867172] [2025-04-29 11:02:02,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:02,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:02,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:02,603 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-04-29 11:02:02,604 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-04-29 11:02:02,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:02:02,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:02:02,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:02,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:02:02,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:02,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110867172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:02,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-29 11:02:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263654831] [2025-04-29 11:02:02,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:02,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:02:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:02,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:02:02,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:02,740 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:02,763 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2025-04-29 11:02:02,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:02,764 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:02:02,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:02,764 INFO L225 Difference]: With dead ends: 91 [2025-04-29 11:02:02,764 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:02:02,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:02,765 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:02,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 223 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:02:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-29 11:02:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-04-29 11:02:02,771 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2025-04-29 11:02:02,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:02,771 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-04-29 11:02:02,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:02,771 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-04-29 11:02:02,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:02:02,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:02,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:02,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:02:02,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:02,974 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:02,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 948014584, now seen corresponding path program 1 times [2025-04-29 11:02:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:02,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494639170] [2025-04-29 11:02:02,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:02,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:02,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:02:02,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:02:02,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:02:03,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:03,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494639170] [2025-04-29 11:02:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494639170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:03,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933106672] [2025-04-29 11:02:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:03,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:03,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:03,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:03,022 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:03,035 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2025-04-29 11:02:03,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:03,036 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:02:03,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:03,036 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:02:03,036 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:02:03,036 INFO L436 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-04-29 11:02:03,037 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:03,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 129 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:02:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 11:02:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-04-29 11:02:03,039 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2025-04-29 11:02:03,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:03,039 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-04-29 11:02:03,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,039 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-04-29 11:02:03,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:02:03,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:03,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:03,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:02:03,041 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:03,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash -676318908, now seen corresponding path program 1 times [2025-04-29 11:02:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:03,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191943221] [2025-04-29 11:02:03,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:03,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:02:03,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:02:03,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:03,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:03,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:03,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191943221] [2025-04-29 11:02:03,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191943221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:03,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:03,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:02:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469806042] [2025-04-29 11:02:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:03,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:03,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:03,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:03,118 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:03,139 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-04-29 11:02:03,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:03,139 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:02:03,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:03,140 INFO L225 Difference]: With dead ends: 54 [2025-04-29 11:02:03,140 INFO L226 Difference]: Without dead ends: 53 [2025-04-29 11:02:03,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:03,141 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:03,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-29 11:02:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-29 11:02:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-04-29 11:02:03,146 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 16 [2025-04-29 11:02:03,146 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:03,146 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-04-29 11:02:03,146 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,146 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-04-29 11:02:03,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:02:03,147 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:03,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:03,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:02:03,147 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:03,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash -543126070, now seen corresponding path program 1 times [2025-04-29 11:02:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:03,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892242692] [2025-04-29 11:02:03,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:03,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:03,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:02:03,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:02:03,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:03,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:03,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:03,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892242692] [2025-04-29 11:02:03,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892242692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:03,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019080148] [2025-04-29 11:02:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:03,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:03,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:03,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:03,198 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:03,225 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-04-29 11:02:03,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:03,225 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:02:03,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:03,225 INFO L225 Difference]: With dead ends: 82 [2025-04-29 11:02:03,226 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:02:03,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:03,226 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:03,226 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 57 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:02:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2025-04-29 11:02:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-04-29 11:02:03,229 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 22 [2025-04-29 11:02:03,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:03,230 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-04-29 11:02:03,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,230 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-04-29 11:02:03,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:02:03,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:03,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:03,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:02:03,230 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:03,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash 342961090, now seen corresponding path program 1 times [2025-04-29 11:02:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:03,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683017880] [2025-04-29 11:02:03,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:03,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:02:03,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:02:03,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:03,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:03,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683017880] [2025-04-29 11:02:03,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683017880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:03,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:03,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516811801] [2025-04-29 11:02:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:03,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:03,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:03,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:03,294 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:03,327 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-04-29 11:02:03,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:03,327 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:02:03,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:03,328 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:02:03,328 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:02:03,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:02:03,330 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:03,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:02:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2025-04-29 11:02:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-04-29 11:02:03,336 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 23 [2025-04-29 11:02:03,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:03,336 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-04-29 11:02:03,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,336 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-04-29 11:02:03,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:02:03,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:03,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:03,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:02:03,337 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:03,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1126871740, now seen corresponding path program 1 times [2025-04-29 11:02:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:03,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384145633] [2025-04-29 11:02:03,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:03,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:02:03,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:02:03,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:03,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:03,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384145633] [2025-04-29 11:02:03,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384145633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:03,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:03,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688199192] [2025-04-29 11:02:03,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:03,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:03,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:03,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:03,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:03,382 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:03,392 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-04-29 11:02:03,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:03,392 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:02:03,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:03,393 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:02:03,393 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:02:03,393 INFO L436 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-04-29 11:02:03,394 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:03,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:02:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-29 11:02:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-04-29 11:02:03,400 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 25 [2025-04-29 11:02:03,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:03,400 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-04-29 11:02:03,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,400 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-04-29 11:02:03,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:02:03,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:03,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:03,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:02:03,400 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:03,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash -573285488, now seen corresponding path program 1 times [2025-04-29 11:02:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:03,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614032115] [2025-04-29 11:02:03,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:03,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:02:03,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:02:03,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:03,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:02:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:03,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614032115] [2025-04-29 11:02:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614032115] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:03,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233252476] [2025-04-29 11:02:03,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:03,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:03,524 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-04-29 11:02:03,526 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-04-29 11:02:03,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:02:03,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:02:03,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:03,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:03,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:02:03,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:03,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233252476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-29 11:02:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045442996] [2025-04-29 11:02:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:03,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:03,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:03,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:03,657 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:03,725 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-04-29 11:02:03,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:03,725 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:02:03,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:03,726 INFO L225 Difference]: With dead ends: 60 [2025-04-29 11:02:03,726 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:02:03,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:03,726 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:03,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 108 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:02:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-04-29 11:02:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-04-29 11:02:03,731 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 26 [2025-04-29 11:02:03,732 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:03,732 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-04-29 11:02:03,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:03,732 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-04-29 11:02:03,733 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:02:03,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:03,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:03,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:02:03,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:03,935 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:03,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:03,935 INFO L85 PathProgramCache]: Analyzing trace with hash -573279530, now seen corresponding path program 1 times [2025-04-29 11:02:03,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:03,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897422235] [2025-04-29 11:02:03,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:03,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:02:03,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:02:03,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:03,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:02:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:04,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897422235] [2025-04-29 11:02:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897422235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:04,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007238179] [2025-04-29 11:02:04,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:04,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:04,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:04,052 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-04-29 11:02:04,053 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-04-29 11:02:04,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:02:04,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:02:04,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:04,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:04,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:04,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:04,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007238179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:04,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-04-29 11:02:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360367483] [2025-04-29 11:02:04,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:04,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:02:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:04,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:02:04,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:04,153 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:04,191 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-04-29 11:02:04,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:04,191 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:02:04,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:04,192 INFO L225 Difference]: With dead ends: 76 [2025-04-29 11:02:04,192 INFO L226 Difference]: Without dead ends: 41 [2025-04-29 11:02:04,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:04,192 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:04,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 59 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-29 11:02:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-04-29 11:02:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-04-29 11:02:04,198 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2025-04-29 11:02:04,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:04,198 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-04-29 11:02:04,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,199 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-04-29 11:02:04,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:02:04,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:04,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:04,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:02:04,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:02:04,400 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:04,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1957918648, now seen corresponding path program 1 times [2025-04-29 11:02:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:04,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230253542] [2025-04-29 11:02:04,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:04,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:02:04,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:02:04,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:04,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:04,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230253542] [2025-04-29 11:02:04,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230253542] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:04,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450292222] [2025-04-29 11:02:04,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:04,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:04,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:04,482 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-04-29 11:02:04,484 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-04-29 11:02:04,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:02:04,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:02:04,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:04,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:04,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:02:04,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:04,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450292222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:04,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 11:02:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7852696] [2025-04-29 11:02:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:04,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:02:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:02:04,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:04,605 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:04,639 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-29 11:02:04,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:04,640 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:02:04,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:04,640 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:02:04,640 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:02:04,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:02:04,640 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:04,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 51 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:02:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-04-29 11:02:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-04-29 11:02:04,643 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2025-04-29 11:02:04,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:04,643 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-04-29 11:02:04,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,643 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-04-29 11:02:04,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:02:04,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:04,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:04,649 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-04-29 11:02:04,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:02:04,844 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:04,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash -565935852, now seen corresponding path program 1 times [2025-04-29 11:02:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:04,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019579549] [2025-04-29 11:02:04,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:04,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:02:04,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:02:04,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:04,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:04,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019579549] [2025-04-29 11:02:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019579549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:04,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:04,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:02:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267490926] [2025-04-29 11:02:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:04,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:02:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:04,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:02:04,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:02:04,897 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:04,918 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-04-29 11:02:04,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:04,918 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:02:04,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:04,919 INFO L225 Difference]: With dead ends: 42 [2025-04-29 11:02:04,919 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:02:04,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:04,919 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:04,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:02:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:02:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-04-29 11:02:04,922 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2025-04-29 11:02:04,923 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:04,923 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-04-29 11:02:04,923 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:04,923 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-04-29 11:02:04,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:02:04,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:04,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:04,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:02:04,923 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:04,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1070605092, now seen corresponding path program 1 times [2025-04-29 11:02:04,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:04,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694370626] [2025-04-29 11:02:04,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:04,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:02:04,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:02:04,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:04,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:05,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694370626] [2025-04-29 11:02:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694370626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:05,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673950315] [2025-04-29 11:02:05,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:05,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:05,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:05,052 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-04-29 11:02:05,053 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-04-29 11:02:05,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:02:05,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:02:05,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:05,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:05,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:02:05,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:05,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673950315] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:05,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:05,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2025-04-29 11:02:05,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890622714] [2025-04-29 11:02:05,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:05,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:02:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:05,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:02:05,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:02:05,228 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:05,293 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-04-29 11:02:05,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:02:05,293 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-29 11:02:05,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:05,293 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:02:05,293 INFO L226 Difference]: Without dead ends: 37 [2025-04-29 11:02:05,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:02:05,295 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:05,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-29 11:02:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-29 11:02:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-04-29 11:02:05,297 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 36 [2025-04-29 11:02:05,297 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:05,297 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-04-29 11:02:05,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:05,299 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-04-29 11:02:05,299 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:02:05,300 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:05,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:05,306 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-04-29 11:02:05,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:05,501 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-04-29 11:02:05,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1070599134, now seen corresponding path program 1 times [2025-04-29 11:02:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:05,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503161434] [2025-04-29 11:02:05,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:05,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:02:05,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:02:05,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:05,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:02:05,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:05,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503161434] [2025-04-29 11:02:05,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503161434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:05,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:05,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:05,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793732328] [2025-04-29 11:02:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:05,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:05,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:05,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:05,542 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:05,555 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-04-29 11:02:05,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:05,555 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-29 11:02:05,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:05,555 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:02:05,555 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:02:05,555 INFO L436 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-04-29 11:02:05,556 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:05,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:02:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:02:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:02:05,556 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2025-04-29 11:02:05,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:05,556 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:02:05,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:05,556 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:02:05,556 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:02:05,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-04-29 11:02:05,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-04-29 11:02:05,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-04-29 11:02:05,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-04-29 11:02:05,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-04-29 11:02:05,559 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-04-29 11:02:05,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:02:05,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:05,563 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:02:05,626 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:02:05,633 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:05,634 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 11:02:05,634 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:05,634 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:05,634 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 11:02:05,634 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:05,638 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-29 11:02:05,639 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-29 11:02:05,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:02:05 BoogieIcfgContainer [2025-04-29 11:02:05,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:02:05,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:02:05,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:02:05,640 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:02:05,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:01" (3/4) ... [2025-04-29 11:02:05,642 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:02:05,646 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2025-04-29 11:02:05,648 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-29 11:02:05,649 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:02:05,649 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:02:05,649 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:02:05,710 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:02:05,710 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:02:05,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:02:05,711 INFO L158 Benchmark]: Toolchain (without parser) took 5245.88ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 40.8MB in the end (delta: 70.9MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2025-04-29 11:02:05,711 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:05,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.58ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:05,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.83ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:05,712 INFO L158 Benchmark]: Boogie Preprocessor took 52.90ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:05,712 INFO L158 Benchmark]: RCFGBuilder took 285.14ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 76.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:05,714 INFO L158 Benchmark]: TraceAbstraction took 4561.31ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 47.6MB in the end (delta: 28.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2025-04-29 11:02:05,714 INFO L158 Benchmark]: Witness Printer took 70.16ms. Allocated memory is still 142.6MB. Free memory was 47.6MB in the beginning and 40.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:02:05,715 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.58ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.83ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.90ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.14ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 76.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4561.31ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 47.6MB in the end (delta: 28.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 70.16ms. Allocated memory is still 142.6MB. Free memory was 47.6MB in the beginning and 40.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 71 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 357 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 1766 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1091 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 497 IncrementalHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 675 mSDtfsCounter, 497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 211 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1105 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 156/181 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((i == 1) && (len == 2)) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:02:05,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE