./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.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/array-examples/data_structures_set_multi_proc_trivial_ground.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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:34:28,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:34:28,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:34:28,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:34:28,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:34:28,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:34:28,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:34:28,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:34:28,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:34:28,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:34:28,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:34:28,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:34:28,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:34:28,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:34:28,592 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:34:28,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:34:28,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:34:28,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:34:28,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:34:28,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:34:28,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:34:28,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:34:28,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:34:28,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:34:28,593 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:34:28,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:34:28,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:34:28,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:34:28,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:34:28,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:34:28,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:34:28,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:34:28,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:34:28,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:34:28,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:34:28,596 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2025-03-09 01:34:28,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:34:28,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:34:28,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:34:28,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:34:28,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:34:28,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-03-09 01:34:30,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47096f8c/eb91ea1a871b4c528238e64759d117bb/FLAG8b130a55b [2025-03-09 01:34:30,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:34:30,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-03-09 01:34:30,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47096f8c/eb91ea1a871b4c528238e64759d117bb/FLAG8b130a55b [2025-03-09 01:34:30,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47096f8c/eb91ea1a871b4c528238e64759d117bb [2025-03-09 01:34:30,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:34:30,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:34:30,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:34:30,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:34:30,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:34:30,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622f11fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30, skipping insertion in model container [2025-03-09 01:34:30,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:34:30,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:34:30,462 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:34:30,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:34:30,496 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:34:30,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30 WrapperNode [2025-03-09 01:34:30,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:34:30,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:34:30,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:34:30,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:34:30,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,527 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2025-03-09 01:34:30,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:34:30,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:34:30,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:34:30,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:34:30,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,544 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-09 01:34:30,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:34:30,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:34:30,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:34:30,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:34:30,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (1/1) ... [2025-03-09 01:34:30,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:34:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:30,579 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 01:34:30,585 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 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:34:30,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 01:34:30,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 01:34:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:34:30,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:34:30,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:34:30,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: call ULTIMATE.dealloc(main_~#set~0#1.base, main_~#set~0#1.offset);havoc main_~#set~0#1.base, main_~#set~0#1.offset;call ULTIMATE.dealloc(main_~#values~0#1.base, main_~#values~0#1.offset);havoc main_~#values~0#1.base, main_~#values~0#1.offset; [2025-03-09 01:34:30,889 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-03-09 01:34:30,889 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:34:30,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:34:30,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:34:30,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:34:30 BoogieIcfgContainer [2025-03-09 01:34:30,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:34:30,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:34:30,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:34:30,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:34:30,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:34:30" (1/3) ... [2025-03-09 01:34:30,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbcbc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:34:30, skipping insertion in model container [2025-03-09 01:34:30,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:30" (2/3) ... [2025-03-09 01:34:30,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbcbc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:34:30, skipping insertion in model container [2025-03-09 01:34:30,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:34:30" (3/3) ... [2025-03-09 01:34:30,909 INFO L128 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2025-03-09 01:34:30,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:34:30,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG data_structures_set_multi_proc_trivial_ground.i that has 2 procedures, 89 locations, 1 initial locations, 10 loop locations, and 28 error locations. [2025-03-09 01:34:30,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:34:30,975 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;@573855c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:34:30,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-09 01:34:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.75) internal successors, (98), 84 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:34:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:34:30,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:30,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:34:30,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 3939327, now seen corresponding path program 1 times [2025-03-09 01:34:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853840862] [2025-03-09 01:34:30,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:31,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:34:31,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:34:31,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:31,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:31,186 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 01:34:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853840862] [2025-03-09 01:34:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853840862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:31,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:31,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:34:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159030422] [2025-03-09 01:34:31,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:31,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:31,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:31,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:31,212 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.75) internal successors, (98), 84 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 01:34:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:31,364 INFO L93 Difference]: Finished difference Result 205 states and 256 transitions. [2025-03-09 01:34:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:31,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-03-09 01:34:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:31,371 INFO L225 Difference]: With dead ends: 205 [2025-03-09 01:34:31,372 INFO L226 Difference]: Without dead ends: 116 [2025-03-09 01:34:31,377 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 01:34:31,379 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 28 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:31,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 222 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-09 01:34:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2025-03-09 01:34:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 90 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:34:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-03-09 01:34:31,416 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 4 [2025-03-09 01:34:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:31,416 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-03-09 01:34:31,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 01:34:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-03-09 01:34:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:34:31,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:31,417 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:34:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:34:31,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1392435357, now seen corresponding path program 1 times [2025-03-09 01:34:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849800768] [2025-03-09 01:34:31,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:31,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:34:31,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:34:31,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:31,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849800768] [2025-03-09 01:34:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849800768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460642924] [2025-03-09 01:34:31,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:31,529 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 01:34:31,530 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 01:34:31,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:34:31,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:34:31,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:31,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:31,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:34:31,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:31,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:34:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460642924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:31,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:34:31,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:34:31,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266149479] [2025-03-09 01:34:31,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:31,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:34:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:31,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:34:31,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:34:31,623 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:31,741 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2025-03-09 01:34:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:34:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:31,742 INFO L225 Difference]: With dead ends: 116 [2025-03-09 01:34:31,742 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 01:34:31,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:34:31,743 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 28 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:31,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 336 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 01:34:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 94. [2025-03-09 01:34:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 89 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:34:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2025-03-09 01:34:31,753 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 7 [2025-03-09 01:34:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:31,753 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2025-03-09 01:34:31,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2025-03-09 01:34:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:34:31,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:31,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 01:34:31,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:34:31,962 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 01:34:31,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:31,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash 215823169, now seen corresponding path program 1 times [2025-03-09 01:34:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14799968] [2025-03-09 01:34:31,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:31,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:31,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:34:31,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:34:31,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:31,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:34:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14799968] [2025-03-09 01:34:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14799968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:34:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365302581] [2025-03-09 01:34:32,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:32,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:34:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:32,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:34:32,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:34:32,006 INFO L87 Difference]: Start difference. First operand 94 states and 109 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 01:34:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:32,034 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2025-03-09 01:34:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:34:32,034 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 01:34:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:32,035 INFO L225 Difference]: With dead ends: 94 [2025-03-09 01:34:32,035 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 01:34:32,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:34:32,035 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:32,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 01:34:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-03-09 01:34:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.639344262295082) internal successors, (100), 86 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:34:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2025-03-09 01:34:32,040 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 8 [2025-03-09 01:34:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:32,040 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2025-03-09 01:34:32,040 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 01:34:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2025-03-09 01:34:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:34:32,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:32,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:34:32,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:32,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1899586069, now seen corresponding path program 1 times [2025-03-09 01:34:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:32,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369612671] [2025-03-09 01:34:32,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:32,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:32,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:34:32,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:34:32,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:32,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369612671] [2025-03-09 01:34:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369612671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894945144] [2025-03-09 01:34:32,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:32,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:32,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:32,112 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 01:34:32,113 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 01:34:32,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:34:32,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:34:32,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:32,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:32,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:34:32,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:32,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894945144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:32,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:34:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839032411] [2025-03-09 01:34:32,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:32,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:34:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:32,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:34:32,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:34:32,202 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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 01:34:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:32,300 INFO L93 Difference]: Finished difference Result 203 states and 240 transitions. [2025-03-09 01:34:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:34:32,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:34:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:32,301 INFO L225 Difference]: With dead ends: 203 [2025-03-09 01:34:32,302 INFO L226 Difference]: Without dead ends: 118 [2025-03-09 01:34:32,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:34:32,302 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 54 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:32,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 281 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-09 01:34:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2025-03-09 01:34:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 92 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:34:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2025-03-09 01:34:32,307 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 9 [2025-03-09 01:34:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:32,307 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2025-03-09 01:34:32,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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 01:34:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2025-03-09 01:34:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:34:32,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:32,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:32,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:34:32,508 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,SelfDestructingSolverStorable3 [2025-03-09 01:34:32,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:32,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2135469397, now seen corresponding path program 2 times [2025-03-09 01:34:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:32,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569384488] [2025-03-09 01:34:32,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:32,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:34:32,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-09 01:34:32,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:34:32,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:34:32,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569384488] [2025-03-09 01:34:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569384488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:32,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:34:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867591657] [2025-03-09 01:34:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:32,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:32,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:32,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:32,558 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:32,586 INFO L93 Difference]: Finished difference Result 197 states and 230 transitions. [2025-03-09 01:34:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:34:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:32,589 INFO L225 Difference]: With dead ends: 197 [2025-03-09 01:34:32,589 INFO L226 Difference]: Without dead ends: 134 [2025-03-09 01:34:32,590 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 01:34:32,590 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:32,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 268 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-09 01:34:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 101. [2025-03-09 01:34:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 96 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:34:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2025-03-09 01:34:32,603 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 15 [2025-03-09 01:34:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:32,603 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2025-03-09 01:34:32,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2025-03-09 01:34:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:34:32,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:32,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:32,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:34:32,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:32,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:32,604 INFO L85 PathProgramCache]: Analyzing trace with hash 824470394, now seen corresponding path program 1 times [2025-03-09 01:34:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:32,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950200837] [2025-03-09 01:34:32,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:32,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:34:32,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:34:32,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:32,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:34:32,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950200837] [2025-03-09 01:34:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950200837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:34:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769802284] [2025-03-09 01:34:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:32,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:32,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:32,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:32,693 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 01:34:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:32,732 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2025-03-09 01:34:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2025-03-09 01:34:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:32,736 INFO L225 Difference]: With dead ends: 187 [2025-03-09 01:34:32,736 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 01:34:32,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:32,737 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 23 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:32,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 174 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 01:34:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-03-09 01:34:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 89 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:34:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2025-03-09 01:34:32,744 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 17 [2025-03-09 01:34:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:32,744 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2025-03-09 01:34:32,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 01:34:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2025-03-09 01:34:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:34:32,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:32,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:32,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:34:32,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:32,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -713179815, now seen corresponding path program 1 times [2025-03-09 01:34:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419469550] [2025-03-09 01:34:32,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:32,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:34:32,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:34:32,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:32,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:34:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419469550] [2025-03-09 01:34:32,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419469550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:32,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851935222] [2025-03-09 01:34:32,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:32,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:32,865 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 01:34:32,867 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 01:34:32,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:34:32,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:34:32,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:32,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:32,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:34:32,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:34:32,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:34:33,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851935222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:33,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:33,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-09 01:34:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830138298] [2025-03-09 01:34:33,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:33,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:34:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:33,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:34:33,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:34:33,068 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:33,153 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2025-03-09 01:34:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:34:33,154 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 01:34:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:33,154 INFO L225 Difference]: With dead ends: 200 [2025-03-09 01:34:33,154 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 01:34:33,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:34:33,155 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:33,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 301 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 01:34:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2025-03-09 01:34:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.451219512195122) internal successors, (119), 101 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:34:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2025-03-09 01:34:33,168 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 18 [2025-03-09 01:34:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:33,168 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2025-03-09 01:34:33,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2025-03-09 01:34:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 01:34:33,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:33,172 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:33,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:34:33,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:33,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:33,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:33,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1717333031, now seen corresponding path program 2 times [2025-03-09 01:34:33,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:33,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059251303] [2025-03-09 01:34:33,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:33,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:33,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:34:33,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:34:33,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:34:33,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-09 01:34:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059251303] [2025-03-09 01:34:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059251303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922341034] [2025-03-09 01:34:33,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:33,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:33,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:33,466 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 01:34:33,468 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 01:34:33,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:34:33,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:34:33,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:34:33,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:33,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:34:33,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:34:33,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:34:33,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922341034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:33,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2025-03-09 01:34:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947364869] [2025-03-09 01:34:33,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:33,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:34:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:33,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:34:33,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:34:33,993 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand has 36 states, 36 states have (on average 1.75) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:34,272 INFO L93 Difference]: Finished difference Result 266 states and 323 transitions. [2025-03-09 01:34:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 01:34:34,272 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 01:34:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:34,273 INFO L225 Difference]: With dead ends: 266 [2025-03-09 01:34:34,273 INFO L226 Difference]: Without dead ends: 185 [2025-03-09 01:34:34,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 01:34:34,274 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 180 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:34,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 774 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:34:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-09 01:34:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 128. [2025-03-09 01:34:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 124 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:34:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2025-03-09 01:34:34,280 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 30 [2025-03-09 01:34:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:34,280 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2025-03-09 01:34:34,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2025-03-09 01:34:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:34:34,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:34,281 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:34,289 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 01:34:34,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:34,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 668605037, now seen corresponding path program 1 times [2025-03-09 01:34:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264393027] [2025-03-09 01:34:34,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:34,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:34:34,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:34:34,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:34,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-09 01:34:34,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:34,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264393027] [2025-03-09 01:34:34,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264393027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:34,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:34,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:34:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345583693] [2025-03-09 01:34:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:34,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:34:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:34,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:34:34,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:34:34,559 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:34,566 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2025-03-09 01:34:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:34:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 55 [2025-03-09 01:34:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:34,567 INFO L225 Difference]: With dead ends: 128 [2025-03-09 01:34:34,567 INFO L226 Difference]: Without dead ends: 127 [2025-03-09 01:34:34,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:34:34,568 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:34,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-09 01:34:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-03-09 01:34:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 121 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:34:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2025-03-09 01:34:34,577 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 55 [2025-03-09 01:34:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:34,577 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2025-03-09 01:34:34,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 01:34:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2025-03-09 01:34:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 01:34:34,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:34,577 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:34,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:34:34,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:34,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:34,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1720392413, now seen corresponding path program 1 times [2025-03-09 01:34:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:34,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132136994] [2025-03-09 01:34:34,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:34,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 01:34:34,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 01:34:34,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:34,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-09 01:34:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132136994] [2025-03-09 01:34:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132136994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644808810] [2025-03-09 01:34:34,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:34,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:34,658 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 01:34:34,661 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 01:34:34,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 01:34:34,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 01:34:34,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:34,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:34,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 01:34:34,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:34:35,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:34:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644808810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:35,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:35,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2025-03-09 01:34:35,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351688439] [2025-03-09 01:34:35,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:35,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-09 01:34:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:35,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-09 01:34:35,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-03-09 01:34:35,990 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 67 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 67 states have internal predecessors, (114), 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 01:34:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:36,254 INFO L93 Difference]: Finished difference Result 310 states and 375 transitions. [2025-03-09 01:34:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-09 01:34:36,257 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 67 states have internal predecessors, (114), 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 57 [2025-03-09 01:34:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:36,258 INFO L225 Difference]: With dead ends: 310 [2025-03-09 01:34:36,258 INFO L226 Difference]: Without dead ends: 233 [2025-03-09 01:34:36,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1099, Invalid=3457, Unknown=0, NotChecked=0, Total=4556 [2025-03-09 01:34:36,259 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 152 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:36,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 714 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:34:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-09 01:34:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 176. [2025-03-09 01:34:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 172 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:34:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2025-03-09 01:34:36,268 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 57 [2025-03-09 01:34:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:36,269 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2025-03-09 01:34:36,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 67 states have internal predecessors, (114), 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 01:34:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2025-03-09 01:34:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 01:34:36,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:36,274 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:36,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:34:36,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 01:34:36,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:36,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1584069039, now seen corresponding path program 2 times [2025-03-09 01:34:36,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:36,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265709784] [2025-03-09 01:34:36,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:36,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:36,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-09 01:34:36,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 108 statements. [2025-03-09 01:34:36,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:34:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-09 01:34:36,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:36,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265709784] [2025-03-09 01:34:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265709784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:36,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:34:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639758246] [2025-03-09 01:34:36,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:36,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:36,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:36,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:36,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:36,519 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:36,534 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2025-03-09 01:34:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 108 [2025-03-09 01:34:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:36,535 INFO L225 Difference]: With dead ends: 188 [2025-03-09 01:34:36,536 INFO L226 Difference]: Without dead ends: 186 [2025-03-09 01:34:36,536 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 01:34:36,536 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:36,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-09 01:34:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2025-03-09 01:34:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.2392638036809815) internal successors, (202), 180 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:34:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2025-03-09 01:34:36,545 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 108 [2025-03-09 01:34:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2025-03-09 01:34:36,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 01:34:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2025-03-09 01:34:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 01:34:36,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:36,550 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:36,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:34:36,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:36,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1861808632, now seen corresponding path program 1 times [2025-03-09 01:34:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:36,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188162536] [2025-03-09 01:34:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:36,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:36,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 01:34:36,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 01:34:36,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:36,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-09 01:34:36,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188162536] [2025-03-09 01:34:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188162536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:36,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:36,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:34:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13978172] [2025-03-09 01:34:36,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:36,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:36,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:36,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:36,721 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:36,735 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2025-03-09 01:34:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:36,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-09 01:34:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:36,737 INFO L225 Difference]: With dead ends: 253 [2025-03-09 01:34:36,737 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 01:34:36,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:34:36,737 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:36,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 01:34:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-09 01:34:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 167 states have (on average 1.2335329341317365) internal successors, (206), 184 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:34:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2025-03-09 01:34:36,742 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 109 [2025-03-09 01:34:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:36,742 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2025-03-09 01:34:36,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2025-03-09 01:34:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 01:34:36,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:36,743 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:36,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:34:36,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:36,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1871987412, now seen corresponding path program 1 times [2025-03-09 01:34:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258910310] [2025-03-09 01:34:36,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:36,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 01:34:36,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 01:34:36,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:36,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-09 01:34:36,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:36,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258910310] [2025-03-09 01:34:36,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258910310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:36,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:36,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:34:36,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124488066] [2025-03-09 01:34:36,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:36,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:36,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:36,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:36,950 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:36,962 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2025-03-09 01:34:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:36,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-09 01:34:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:36,963 INFO L225 Difference]: With dead ends: 198 [2025-03-09 01:34:36,963 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 01:34:36,964 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 01:34:36,965 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:36,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 01:34:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-09 01:34:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 113 states have internal predecessors, (116), 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 01:34:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2025-03-09 01:34:36,969 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 110 [2025-03-09 01:34:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:36,969 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2025-03-09 01:34:36,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2025-03-09 01:34:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-09 01:34:36,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:36,970 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:36,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:34:36,971 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:36,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1803291936, now seen corresponding path program 1 times [2025-03-09 01:34:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:36,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525910294] [2025-03-09 01:34:36,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:36,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 01:34:36,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 01:34:36,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:36,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-09 01:34:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:37,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525910294] [2025-03-09 01:34:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525910294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:37,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:37,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:34:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664801054] [2025-03-09 01:34:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:37,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:37,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:37,095 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 01:34:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:37,113 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2025-03-09 01:34:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:37,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 111 [2025-03-09 01:34:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:37,114 INFO L225 Difference]: With dead ends: 124 [2025-03-09 01:34:37,114 INFO L226 Difference]: Without dead ends: 122 [2025-03-09 01:34:37,114 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 01:34:37,114 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:37,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-09 01:34:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-09 01:34:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 121 states have internal predecessors, (124), 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 01:34:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2025-03-09 01:34:37,120 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 111 [2025-03-09 01:34:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:37,120 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2025-03-09 01:34:37,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 01:34:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2025-03-09 01:34:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-09 01:34:37,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:37,121 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:37,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:34:37,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:37,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1896131680, now seen corresponding path program 1 times [2025-03-09 01:34:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:37,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18961592] [2025-03-09 01:34:37,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:37,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:37,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 01:34:37,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 01:34:37,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:37,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:34:39,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:39,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18961592] [2025-03-09 01:34:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18961592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496446906] [2025-03-09 01:34:39,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:39,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:39,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:34:39,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:34:39,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 01:34:39,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 01:34:39,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:39,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:39,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-09 01:34:39,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:34:39,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:34:41,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496446906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:41,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:41,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2025-03-09 01:34:41,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460289301] [2025-03-09 01:34:41,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:41,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2025-03-09 01:34:41,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:41,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2025-03-09 01:34:41,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2025-03-09 01:34:41,779 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 130 states, 130 states have (on average 1.6076923076923078) internal successors, (209), 130 states have internal predecessors, (209), 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 01:34:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:41,968 INFO L93 Difference]: Finished difference Result 244 states and 279 transitions. [2025-03-09 01:34:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-03-09 01:34:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 1.6076923076923078) internal successors, (209), 130 states have internal predecessors, (209), 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 119 [2025-03-09 01:34:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:41,973 INFO L225 Difference]: With dead ends: 244 [2025-03-09 01:34:41,973 INFO L226 Difference]: Without dead ends: 218 [2025-03-09 01:34:41,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5206 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2025-03-09 01:34:41,978 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:41,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-09 01:34:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-09 01:34:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.0185185185185186) internal successors, (220), 217 states have internal predecessors, (220), 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 01:34:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 220 transitions. [2025-03-09 01:34:41,985 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 220 transitions. Word has length 119 [2025-03-09 01:34:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:41,985 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 220 transitions. [2025-03-09 01:34:41,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 1.6076923076923078) internal successors, (209), 130 states have internal predecessors, (209), 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 01:34:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 220 transitions. [2025-03-09 01:34:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-09 01:34:41,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:41,987 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:41,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:34:42,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:34:42,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:42,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1003610208, now seen corresponding path program 2 times [2025-03-09 01:34:42,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57246432] [2025-03-09 01:34:42,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:42,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-09 01:34:42,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-09 01:34:42,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:34:42,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5934 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5927 trivial. 0 not checked. [2025-03-09 01:34:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57246432] [2025-03-09 01:34:42,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57246432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876832069] [2025-03-09 01:34:42,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:42,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:42,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:42,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:34:42,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:34:42,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-09 01:34:42,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-09 01:34:42,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:34:42,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:42,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-09 01:34:42,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5934 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:34:46,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5934 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:34:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876832069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:55,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 129, 129] total 260 [2025-03-09 01:34:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175226926] [2025-03-09 01:34:55,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 260 states [2025-03-09 01:34:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:55,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2025-03-09 01:34:55,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2025-03-09 01:34:55,278 INFO L87 Difference]: Start difference. First operand 218 states and 220 transitions. Second operand has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 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 01:34:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:55,895 INFO L93 Difference]: Finished difference Result 435 states and 503 transitions. [2025-03-09 01:34:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2025-03-09 01:34:55,895 INFO L78 Accepts]: Start accepts. Automaton has has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 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 215 [2025-03-09 01:34:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:55,897 INFO L225 Difference]: With dead ends: 435 [2025-03-09 01:34:55,897 INFO L226 Difference]: Without dead ends: 409 [2025-03-09 01:34:55,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19906 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16782, Invalid=51600, Unknown=0, NotChecked=0, Total=68382 [2025-03-09 01:34:55,901 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:55,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:34:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-09 01:34:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-03-09 01:34:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.0073529411764706) internal successors, (411), 408 states have internal predecessors, (411), 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 01:34:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 411 transitions. [2025-03-09 01:34:55,912 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 411 transitions. Word has length 215 [2025-03-09 01:34:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:55,912 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 411 transitions. [2025-03-09 01:34:55,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 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 01:34:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 411 transitions. [2025-03-09 01:34:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-09 01:34:55,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:55,916 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:55,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:34:56,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:56,120 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-09 01:34:56,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2106801240, now seen corresponding path program 1 times [2025-03-09 01:34:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101280467] [2025-03-09 01:34:56,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:56,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-09 01:34:56,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-09 01:34:56,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:56,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 24143 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24136 trivial. 0 not checked. [2025-03-09 01:34:56,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101280467] [2025-03-09 01:34:56,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101280467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:56,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:56,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:34:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702187645] [2025-03-09 01:34:56,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:56,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:56,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:56,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:56,399 INFO L87 Difference]: Start difference. First operand 409 states and 411 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 01:34:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:56,414 INFO L93 Difference]: Finished difference Result 409 states and 411 transitions. [2025-03-09 01:34:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:56,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 408 [2025-03-09 01:34:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:56,416 INFO L225 Difference]: With dead ends: 409 [2025-03-09 01:34:56,416 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:34:56,417 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 01:34:56,417 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:56,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:34:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:34:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:34:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:34:56,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2025-03-09 01:34:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:34:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 01:34:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:34:56,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:34:56,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2025-03-09 01:34:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-03-09 01:34:56,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-03-09 01:34:56,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:34:56,428 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:56,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:34:57,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:34:57,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2025-03-09 01:34:57,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~0 [2025-03-09 01:34:57,393 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2025-03-09 01:34:57,393 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~0 [2025-03-09 01:34:57,393 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2025-03-09 01:34:57,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:34:57 BoogieIcfgContainer [2025-03-09 01:34:57,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:34:57,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:34:57,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:34:57,399 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:34:57,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:34:30" (3/4) ... [2025-03-09 01:34:57,401 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:34:57,405 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 01:34:57,413 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-09 01:34:57,414 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 01:34:57,414 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:34:57,414 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:34:57,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:34:57,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:34:57,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:34:57,489 INFO L158 Benchmark]: Toolchain (without parser) took 27178.31ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 132.4MB in the beginning and 198.5MB in the end (delta: -66.2MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2025-03-09 01:34:57,489 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:34:57,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.56ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 120.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:34:57,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.65ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:34:57,489 INFO L158 Benchmark]: Boogie Preprocessor took 23.17ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:34:57,489 INFO L158 Benchmark]: IcfgBuilder took 348.48ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 97.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:34:57,490 INFO L158 Benchmark]: TraceAbstraction took 26495.48ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 96.6MB in the beginning and 205.5MB in the end (delta: -108.9MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2025-03-09 01:34:57,490 INFO L158 Benchmark]: Witness Printer took 89.70ms. Allocated memory is still 310.4MB. Free memory was 205.5MB in the beginning and 198.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:34:57,491 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.56ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 120.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.65ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.17ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 348.48ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 97.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26495.48ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 96.6MB in the beginning and 205.5MB in the end (delta: -108.9MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. * Witness Printer took 89.70ms. Allocated memory is still 310.4MB. Free memory was 205.5MB in the beginning and 198.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 107 edges, 28 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 17, TraceHistogramMax: 127, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 4196 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3235 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2179 IncrementalHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 961 mSDtfsCounter, 2179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26637 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=16, InterpolantAutomatonStates: 557, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 235 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 1855 NumberOfCodeBlocks, 1747 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2273 ConstructedInterpolants, 0 QuantifiedInterpolants, 4313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2230 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 36628/53601 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: (((size == 0) && (i == 0)) || ((size == 0) && (i == 0))) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (((1 <= v) && (n == 0)) || ((n == 0) && (v == 0))) - InvariantResult [Line: 61]: Location Invariant Derived location invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 51]: Location Invariant Derived location invariant: (((1 <= v) && (n == 0)) || ((n == 0) && (v == 0))) - InvariantResult [Line: 62]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 56]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 33]: Location Invariant Derived location invariant: (((1 <= x) && (n == 0)) || ((n == 0) && (x == 0))) - InvariantResult [Line: 40]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 55]: Location Invariant Derived location invariant: ((((n == 0) && (v == 0)) && (x == 0)) || ((((1 <= v) && (n == 0)) && (x == 0)) && (v <= 99999))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((n == 0) && (x == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:34:57,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE