./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i -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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:10:27,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:10:27,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:10:27,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:10:27,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:10:27,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:10:27,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:10:27,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:10:27,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:10:27,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:10:27,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:10:27,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:10:27,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:10:27,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:10:27,937 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:10:27,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:10:27,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:10:27,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:10:27,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:10:27,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:10:27,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:10:27,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:10:27,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:10:27,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:10:27,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:10:27,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:10:27,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:10:27,940 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2025-03-09 06:10:28,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:10:28,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:10:28,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:10:28,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:10:28,174 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:10:28,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i [2025-03-09 06:10:29,335 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c784ba140/8e40bbf0f3f64df4a062a8fcb41d894c/FLAG3cc18164c [2025-03-09 06:10:29,627 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:10:29,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i [2025-03-09 06:10:29,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c784ba140/8e40bbf0f3f64df4a062a8fcb41d894c/FLAG3cc18164c [2025-03-09 06:10:29,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c784ba140/8e40bbf0f3f64df4a062a8fcb41d894c [2025-03-09 06:10:29,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:10:29,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:10:29,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:10:29,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:10:29,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:10:29,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:10:29" (1/1) ... [2025-03-09 06:10:29,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580c9718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:29, skipping insertion in model container [2025-03-09 06:10:29,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:10:29" (1/1) ... [2025-03-09 06:10:29,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:10:30,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:10:30,308 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:10:30,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:10:30,401 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:10:30,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30 WrapperNode [2025-03-09 06:10:30,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:10:30,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:10:30,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:10:30,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:10:30,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,469 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1509 [2025-03-09 06:10:30,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:10:30,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:10:30,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:10:30,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:10:30,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,552 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-09 06:10:30,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:10:30,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:10:30,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:10:30,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:10:30,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (1/1) ... [2025-03-09 06:10:30,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:10:30,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:30,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:10:30,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:10:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:10:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:10:30,657 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:10:30,657 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:10:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:10:30,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:10:30,850 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:10:30,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:10:32,072 INFO L? ?]: Removed 381 outVars from TransFormulas that were not future-live. [2025-03-09 06:10:32,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:10:32,129 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:10:32,129 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-09 06:10:32,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:10:32 BoogieIcfgContainer [2025-03-09 06:10:32,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:10:32,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:10:32,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:10:32,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:10:32,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:10:29" (1/3) ... [2025-03-09 06:10:32,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc7700a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:10:32, skipping insertion in model container [2025-03-09 06:10:32,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:30" (2/3) ... [2025-03-09 06:10:32,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc7700a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:10:32, skipping insertion in model container [2025-03-09 06:10:32,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:10:32" (3/3) ... [2025-03-09 06:10:32,136 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test4-1.i [2025-03-09 06:10:32,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:10:32,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test4-1.i that has 3 procedures, 407 locations, 1 initial locations, 34 loop locations, and 4 error locations. [2025-03-09 06:10:32,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:10:32,190 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64863c5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:10:32,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 06:10:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 403 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 395 states have internal predecessors, (631), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:10:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 06:10:32,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:32,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:32,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:32,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash -235831506, now seen corresponding path program 1 times [2025-03-09 06:10:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148562566] [2025-03-09 06:10:32,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:32,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:10:32,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:10:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:10:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148562566] [2025-03-09 06:10:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148562566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:32,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:10:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392157043] [2025-03-09 06:10:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:32,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 06:10:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:32,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:10:32,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:10:32,335 INFO L87 Difference]: Start difference. First operand has 403 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 395 states have internal predecessors, (631), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-03-09 06:10:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:32,462 INFO L93 Difference]: Finished difference Result 801 states and 1281 transitions. [2025-03-09 06:10:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:10:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-09 06:10:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:32,470 INFO L225 Difference]: With dead ends: 801 [2025-03-09 06:10:32,470 INFO L226 Difference]: Without dead ends: 392 [2025-03-09 06:10:32,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:10:32,475 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:32,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-09 06:10:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-09 06:10:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 382 states have (on average 1.450261780104712) internal successors, (554), 384 states have internal predecessors, (554), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:10:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 566 transitions. [2025-03-09 06:10:32,542 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 566 transitions. Word has length 7 [2025-03-09 06:10:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:32,542 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 566 transitions. [2025-03-09 06:10:32,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-03-09 06:10:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 566 transitions. [2025-03-09 06:10:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:10:32,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:32,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:32,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:10:32,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:32,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1279188344, now seen corresponding path program 1 times [2025-03-09 06:10:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:32,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137933078] [2025-03-09 06:10:32,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:32,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:10:32,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:10:32,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:32,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:10:32,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308442101] [2025-03-09 06:10:32,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:32,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:32,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:32,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:10:32,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:10:32,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:10:32,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:10:32,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:32,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:10:32,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:10:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:10:32,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:10:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137933078] [2025-03-09 06:10:32,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 06:10:32,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308442101] [2025-03-09 06:10:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308442101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:32,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:32,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:10:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948493561] [2025-03-09 06:10:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:32,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:10:32,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:32,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:10:32,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:32,740 INFO L87 Difference]: Start difference. First operand 392 states and 566 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-03-09 06:10:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:32,903 INFO L93 Difference]: Finished difference Result 773 states and 1121 transitions. [2025-03-09 06:10:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:10:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-03-09 06:10:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:32,906 INFO L225 Difference]: With dead ends: 773 [2025-03-09 06:10:32,906 INFO L226 Difference]: Without dead ends: 772 [2025-03-09 06:10:32,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:32,908 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 537 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:32,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1108 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-09 06:10:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 397. [2025-03-09 06:10:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 387 states have (on average 1.4444444444444444) internal successors, (559), 389 states have internal predecessors, (559), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:10:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 571 transitions. [2025-03-09 06:10:32,931 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 571 transitions. Word has length 8 [2025-03-09 06:10:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:32,931 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 571 transitions. [2025-03-09 06:10:32,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-03-09 06:10:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 571 transitions. [2025-03-09 06:10:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-09 06:10:32,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:32,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:32,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:10:33,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:33,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:33,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1961729167, now seen corresponding path program 1 times [2025-03-09 06:10:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166256849] [2025-03-09 06:10:33,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:33,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:33,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-09 06:10:33,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-09 06:10:33,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:33,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:10:33,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:33,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166256849] [2025-03-09 06:10:33,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166256849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:33,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:33,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:10:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338981252] [2025-03-09 06:10:33,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:33,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:10:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:33,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:10:33,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:10:33,642 INFO L87 Difference]: Start difference. First operand 397 states and 571 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-03-09 06:10:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:33,801 INFO L93 Difference]: Finished difference Result 789 states and 1137 transitions. [2025-03-09 06:10:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:10:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 148 [2025-03-09 06:10:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:33,803 INFO L225 Difference]: With dead ends: 789 [2025-03-09 06:10:33,803 INFO L226 Difference]: Without dead ends: 400 [2025-03-09 06:10:33,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-09 06:10:33,804 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 105 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:33,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1401 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-09 06:10:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2025-03-09 06:10:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 387 states have (on average 1.426356589147287) internal successors, (552), 389 states have internal predecessors, (552), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:10:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 564 transitions. [2025-03-09 06:10:33,823 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 564 transitions. Word has length 148 [2025-03-09 06:10:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:33,823 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 564 transitions. [2025-03-09 06:10:33,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-03-09 06:10:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 564 transitions. [2025-03-09 06:10:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-09 06:10:33,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:33,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:10:33,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash -215224904, now seen corresponding path program 1 times [2025-03-09 06:10:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140795254] [2025-03-09 06:10:33,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:33,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-09 06:10:33,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-09 06:10:33,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:33,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:10:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:34,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140795254] [2025-03-09 06:10:34,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140795254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:34,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:34,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:10:34,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113317325] [2025-03-09 06:10:34,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:34,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:10:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:34,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:10:34,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:34,109 INFO L87 Difference]: Start difference. First operand 397 states and 564 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-03-09 06:10:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:34,222 INFO L93 Difference]: Finished difference Result 911 states and 1305 transitions. [2025-03-09 06:10:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:10:34,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 148 [2025-03-09 06:10:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:34,224 INFO L225 Difference]: With dead ends: 911 [2025-03-09 06:10:34,224 INFO L226 Difference]: Without dead ends: 522 [2025-03-09 06:10:34,225 INFO L434 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-03-09 06:10:34,225 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 134 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:34,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1020 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-09 06:10:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-09 06:10:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 512 states have (on average 1.4375) internal successors, (736), 514 states have internal predecessors, (736), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:10:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 748 transitions. [2025-03-09 06:10:34,236 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 748 transitions. Word has length 148 [2025-03-09 06:10:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:34,236 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 748 transitions. [2025-03-09 06:10:34,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-03-09 06:10:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 748 transitions. [2025-03-09 06:10:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-09 06:10:34,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:34,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:10:34,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:34,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1098602317, now seen corresponding path program 1 times [2025-03-09 06:10:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:34,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589603699] [2025-03-09 06:10:34,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:34,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-09 06:10:34,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-09 06:10:34,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:34,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:10:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589603699] [2025-03-09 06:10:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589603699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:34,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:34,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:10:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69096128] [2025-03-09 06:10:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:34,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:10:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:34,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:10:34,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:10:34,556 INFO L87 Difference]: Start difference. First operand 522 states and 748 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:34,685 INFO L93 Difference]: Finished difference Result 869 states and 1238 transitions. [2025-03-09 06:10:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:10:34,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2025-03-09 06:10:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:34,689 INFO L225 Difference]: With dead ends: 869 [2025-03-09 06:10:34,689 INFO L226 Difference]: Without dead ends: 480 [2025-03-09 06:10:34,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-09 06:10:34,690 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 30 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:34,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1250 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-09 06:10:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-09 06:10:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 470 states have (on average 1.402127659574468) internal successors, (659), 472 states have internal predecessors, (659), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:10:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 671 transitions. [2025-03-09 06:10:34,708 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 671 transitions. Word has length 163 [2025-03-09 06:10:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:34,708 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 671 transitions. [2025-03-09 06:10:34,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 671 transitions. [2025-03-09 06:10:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-09 06:10:34,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:34,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:34,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:10:34,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:34,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1790083885, now seen corresponding path program 1 times [2025-03-09 06:10:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706669529] [2025-03-09 06:10:34,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:34,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-09 06:10:34,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-09 06:10:34,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:34,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:10:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706669529] [2025-03-09 06:10:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706669529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:34,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:10:34,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973787808] [2025-03-09 06:10:34,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:34,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:10:34,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:34,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:10:34,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:34,945 INFO L87 Difference]: Start difference. First operand 480 states and 671 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:35,059 INFO L93 Difference]: Finished difference Result 970 states and 1345 transitions. [2025-03-09 06:10:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:10:35,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2025-03-09 06:10:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:35,062 INFO L225 Difference]: With dead ends: 970 [2025-03-09 06:10:35,062 INFO L226 Difference]: Without dead ends: 623 [2025-03-09 06:10:35,062 INFO L434 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-03-09 06:10:35,063 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 242 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:35,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 872 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-09 06:10:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2025-03-09 06:10:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 610 states have (on average 1.3885245901639345) internal successors, (847), 612 states have internal predecessors, (847), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 06:10:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 865 transitions. [2025-03-09 06:10:35,076 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 865 transitions. Word has length 163 [2025-03-09 06:10:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:35,076 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 865 transitions. [2025-03-09 06:10:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 865 transitions. [2025-03-09 06:10:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-09 06:10:35,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:35,078 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:35,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:10:35,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:35,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash -660852123, now seen corresponding path program 1 times [2025-03-09 06:10:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215581994] [2025-03-09 06:10:35,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:35,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-09 06:10:35,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-09 06:10:35,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:35,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:10:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215581994] [2025-03-09 06:10:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215581994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:10:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816787946] [2025-03-09 06:10:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:35,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:10:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:35,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:10:35,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:10:35,346 INFO L87 Difference]: Start difference. First operand 623 states and 865 transitions. Second operand has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:35,474 INFO L93 Difference]: Finished difference Result 688 states and 950 transitions. [2025-03-09 06:10:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:10:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 178 [2025-03-09 06:10:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:35,477 INFO L225 Difference]: With dead ends: 688 [2025-03-09 06:10:35,477 INFO L226 Difference]: Without dead ends: 686 [2025-03-09 06:10:35,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:10:35,479 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 293 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:35,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1374 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-09 06:10:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-09 06:10:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 670 states have (on average 1.3791044776119403) internal successors, (924), 672 states have internal predecessors, (924), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 06:10:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 948 transitions. [2025-03-09 06:10:35,497 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 948 transitions. Word has length 178 [2025-03-09 06:10:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:35,498 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 948 transitions. [2025-03-09 06:10:35,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 948 transitions. [2025-03-09 06:10:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-09 06:10:35,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:35,499 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:35,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:10:35,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:35,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -510653321, now seen corresponding path program 1 times [2025-03-09 06:10:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:35,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694552919] [2025-03-09 06:10:35,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:35,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:35,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 06:10:36,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 06:10:36,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:36,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 06:10:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694552919] [2025-03-09 06:10:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694552919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:10:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110259590] [2025-03-09 06:10:36,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:36,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:36,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:36,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:10:36,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:10:36,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 06:10:36,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 06:10:36,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:36,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:36,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:10:36,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:10:36,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:10:36,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 06:10:37,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:10:37,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-09 06:10:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:10:37,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:10:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110259590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:37,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:10:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-09 06:10:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882607857] [2025-03-09 06:10:37,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:37,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:10:37,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:37,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:10:37,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:10:37,432 INFO L87 Difference]: Start difference. First operand 686 states and 948 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:39,728 INFO L93 Difference]: Finished difference Result 1336 states and 1840 transitions. [2025-03-09 06:10:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:10:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-09 06:10:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:39,732 INFO L225 Difference]: With dead ends: 1336 [2025-03-09 06:10:39,732 INFO L226 Difference]: Without dead ends: 736 [2025-03-09 06:10:39,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:10:39,733 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 737 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:39,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 2607 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 06:10:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-09 06:10:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 715. [2025-03-09 06:10:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 699 states have (on average 1.3733905579399142) internal successors, (960), 701 states have internal predecessors, (960), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 06:10:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 984 transitions. [2025-03-09 06:10:39,750 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 984 transitions. Word has length 184 [2025-03-09 06:10:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:39,750 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 984 transitions. [2025-03-09 06:10:39,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 984 transitions. [2025-03-09 06:10:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-09 06:10:39,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:39,752 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:39,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:10:39,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-09 06:10:39,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash -338239240, now seen corresponding path program 1 times [2025-03-09 06:10:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458270731] [2025-03-09 06:10:39,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:40,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 06:10:40,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 06:10:40,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:40,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:10:40,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:40,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458270731] [2025-03-09 06:10:40,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458270731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:40,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:40,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:10:40,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249112351] [2025-03-09 06:10:40,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:40,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:10:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:40,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:10:40,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:40,138 INFO L87 Difference]: Start difference. First operand 715 states and 984 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:40,217 INFO L93 Difference]: Finished difference Result 1350 states and 1862 transitions. [2025-03-09 06:10:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:10:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-09 06:10:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:40,220 INFO L225 Difference]: With dead ends: 1350 [2025-03-09 06:10:40,220 INFO L226 Difference]: Without dead ends: 731 [2025-03-09 06:10:40,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:40,221 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:40,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 848 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-09 06:10:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2025-03-09 06:10:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 713 states have (on average 1.3632538569424966) internal successors, (972), 715 states have internal predecessors, (972), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 06:10:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 996 transitions. [2025-03-09 06:10:40,236 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 996 transitions. Word has length 184 [2025-03-09 06:10:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:40,236 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 996 transitions. [2025-03-09 06:10:40,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 996 transitions. [2025-03-09 06:10:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-09 06:10:40,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:40,238 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:40,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:10:40,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:40,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2142935353, now seen corresponding path program 1 times [2025-03-09 06:10:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551306293] [2025-03-09 06:10:40,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:40,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 06:10:40,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 06:10:40,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:40,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:10:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551306293] [2025-03-09 06:10:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551306293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:40,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:40,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:10:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056131454] [2025-03-09 06:10:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:10:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:40,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:10:40,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:10:40,393 INFO L87 Difference]: Start difference. First operand 729 states and 996 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:40,476 INFO L93 Difference]: Finished difference Result 1291 states and 1757 transitions. [2025-03-09 06:10:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:10:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-09 06:10:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:40,479 INFO L225 Difference]: With dead ends: 1291 [2025-03-09 06:10:40,479 INFO L226 Difference]: Without dead ends: 590 [2025-03-09 06:10:40,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-09 06:10:40,480 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 9 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:40,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1046 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-09 06:10:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-09 06:10:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 574 states have (on average 1.329268292682927) internal successors, (763), 576 states have internal predecessors, (763), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 06:10:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 787 transitions. [2025-03-09 06:10:40,494 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 787 transitions. Word has length 184 [2025-03-09 06:10:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:40,494 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 787 transitions. [2025-03-09 06:10:40,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 787 transitions. [2025-03-09 06:10:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-09 06:10:40,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:40,496 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:40,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:10:40,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:40,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash -6473068, now seen corresponding path program 1 times [2025-03-09 06:10:40,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376536465] [2025-03-09 06:10:40,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:40,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:40,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-09 06:10:40,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-09 06:10:40,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:40,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 06:10:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:41,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376536465] [2025-03-09 06:10:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376536465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:10:41,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777792882] [2025-03-09 06:10:41,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:41,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:41,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:41,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:10:41,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:10:41,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-09 06:10:41,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-09 06:10:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:41,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:41,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:10:41,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:10:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:10:41,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:10:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777792882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:10:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:10:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751883812] [2025-03-09 06:10:41,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:41,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:10:41,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:41,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:10:41,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:10:41,584 INFO L87 Difference]: Start difference. First operand 590 states and 787 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:41,704 INFO L93 Difference]: Finished difference Result 1142 states and 1534 transitions. [2025-03-09 06:10:41,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:10:41,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-09 06:10:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:41,707 INFO L225 Difference]: With dead ends: 1142 [2025-03-09 06:10:41,707 INFO L226 Difference]: Without dead ends: 590 [2025-03-09 06:10:41,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:10:41,708 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 13 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:41,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 972 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-09 06:10:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-09 06:10:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 574 states have (on average 1.3257839721254356) internal successors, (761), 576 states have internal predecessors, (761), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 06:10:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 785 transitions. [2025-03-09 06:10:41,723 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 785 transitions. Word has length 185 [2025-03-09 06:10:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:41,724 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 785 transitions. [2025-03-09 06:10:41,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 785 transitions. [2025-03-09 06:10:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-09 06:10:41,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:41,725 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:41,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:10:41,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:41,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:41,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:41,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1317435340, now seen corresponding path program 1 times [2025-03-09 06:10:41,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:41,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759631890] [2025-03-09 06:10:41,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:41,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-09 06:10:41,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-09 06:10:41,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:41,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:10:42,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:42,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759631890] [2025-03-09 06:10:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759631890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:42,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:42,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:10:42,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944389747] [2025-03-09 06:10:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:42,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:10:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:42,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:10:42,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:10:42,244 INFO L87 Difference]: Start difference. First operand 590 states and 785 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:42,449 INFO L93 Difference]: Finished difference Result 1145 states and 1536 transitions. [2025-03-09 06:10:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:10:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-09 06:10:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:42,451 INFO L225 Difference]: With dead ends: 1145 [2025-03-09 06:10:42,451 INFO L226 Difference]: Without dead ends: 596 [2025-03-09 06:10:42,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-09 06:10:42,452 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 4 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:42,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1266 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:10:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-09 06:10:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-09 06:10:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 580 states have (on average 1.3224137931034483) internal successors, (767), 582 states have internal predecessors, (767), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 06:10:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 791 transitions. [2025-03-09 06:10:42,467 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 791 transitions. Word has length 186 [2025-03-09 06:10:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:42,467 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 791 transitions. [2025-03-09 06:10:42,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 06:10:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 791 transitions. [2025-03-09 06:10:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-09 06:10:42,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:42,468 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:42,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:10:42,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:42,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash -248963459, now seen corresponding path program 1 times [2025-03-09 06:10:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786199059] [2025-03-09 06:10:42,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:42,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-09 06:10:42,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-09 06:10:42,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:42,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 06:10:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786199059] [2025-03-09 06:10:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786199059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:10:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487596968] [2025-03-09 06:10:43,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:43,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:43,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:10:43,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:10:43,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-09 06:10:43,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-09 06:10:43,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:43,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:43,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:10:43,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:10:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:10:43,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:10:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487596968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:43,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:10:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-03-09 06:10:43,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996221327] [2025-03-09 06:10:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:43,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:10:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:43,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:10:43,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:10:43,722 INFO L87 Difference]: Start difference. First operand 596 states and 791 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:10:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:43,866 INFO L93 Difference]: Finished difference Result 1104 states and 1480 transitions. [2025-03-09 06:10:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:10:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 187 [2025-03-09 06:10:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:43,869 INFO L225 Difference]: With dead ends: 1104 [2025-03-09 06:10:43,871 INFO L226 Difference]: Without dead ends: 599 [2025-03-09 06:10:43,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:10:43,872 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 363 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:43,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1429 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-09 06:10:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-09 06:10:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 582 states have (on average 1.3230240549828178) internal successors, (770), 585 states have internal predecessors, (770), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-09 06:10:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 798 transitions. [2025-03-09 06:10:43,889 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 798 transitions. Word has length 187 [2025-03-09 06:10:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 798 transitions. [2025-03-09 06:10:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:10:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 798 transitions. [2025-03-09 06:10:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-09 06:10:43,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:43,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:43,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:10:44,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:44,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 06:10:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash -792763387, now seen corresponding path program 1 times [2025-03-09 06:10:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812255787] [2025-03-09 06:10:44,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:44,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:44,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-09 06:10:44,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-09 06:10:44,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:44,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 06:10:44,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:44,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812255787] [2025-03-09 06:10:44,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812255787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:10:44,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391132836] [2025-03-09 06:10:44,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:44,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:44,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:44,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:10:44,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:10:44,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-09 06:10:45,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-09 06:10:45,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:45,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:45,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-09 06:10:45,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:10:45,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:10:45,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:10:45,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2025-03-09 06:10:45,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2025-03-09 06:10:45,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-09 06:10:45,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:10:45,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:10:45,726 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-09 06:10:45,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-09 06:10:45,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:10:45,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-09 06:10:45,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:10:45,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-09 06:10:45,950 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 06:10:45,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-03-09 06:10:45,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-09 06:10:45,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16