./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:03,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:03,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:35:03,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:03,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:03,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:03,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:03,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:03,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:03,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:03,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:03,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:03,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:03,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:03,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:03,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:03,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:03,376 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2025-03-04 11:35:03,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:03,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:03,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:03,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:03,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:03,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-04 11:35:04,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1564daa/2ccdf8cd98e740888ab224fb6088c2ca/FLAG0a96ec0d2 [2025-03-04 11:35:04,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:04,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-04 11:35:04,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1564daa/2ccdf8cd98e740888ab224fb6088c2ca/FLAG0a96ec0d2 [2025-03-04 11:35:05,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1564daa/2ccdf8cd98e740888ab224fb6088c2ca [2025-03-04 11:35:05,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:05,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:05,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:05,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:05,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:05,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05, skipping insertion in model container [2025-03-04 11:35:05,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:05,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:05,539 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:05,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:05,600 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:05,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05 WrapperNode [2025-03-04 11:35:05,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:05,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:05,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:05,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:05,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,654 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 428 [2025-03-04 11:35:05,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:05,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:05,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:05,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:05,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,690 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:35:05,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:05,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:05,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:05,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:05,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (1/1) ... [2025-03-04 11:35:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:05,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:35:05,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:35:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-04 11:35:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-04 11:35:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-04 11:35:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-04 11:35:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-04 11:35:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-04 11:35:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-04 11:35:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-04 11:35:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-04 11:35:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-04 11:35:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:35:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:35:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:05,859 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:05,861 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:06,342 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:06,343 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:06,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:06,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:06,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:06 BoogieIcfgContainer [2025-03-04 11:35:06,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:06,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:06,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:06,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:06,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:05" (1/3) ... [2025-03-04 11:35:06,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3435b1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:06, skipping insertion in model container [2025-03-04 11:35:06,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:05" (2/3) ... [2025-03-04 11:35:06,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3435b1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:06, skipping insertion in model container [2025-03-04 11:35:06,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:06" (3/3) ... [2025-03-04 11:35:06,368 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-04 11:35:06,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:06,381 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c that has 7 procedures, 192 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 11:35:06,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:06,435 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;@64b7a35c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:06,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 11:35:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 152 states have internal predecessors, (223), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 11:35:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:35:06,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:06,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:06,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:06,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1907291707, now seen corresponding path program 1 times [2025-03-04 11:35:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:06,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110951228] [2025-03-04 11:35:06,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:06,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:06,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:35:06,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:35:06,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:06,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:06,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110951228] [2025-03-04 11:35:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110951228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026480112] [2025-03-04 11:35:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:06,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:06,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:06,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:06,728 INFO L87 Difference]: Start difference. First operand has 192 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 152 states have internal predecessors, (223), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:35:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:06,800 INFO L93 Difference]: Finished difference Result 399 states and 654 transitions. [2025-03-04 11:35:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:06,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 11:35:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:06,810 INFO L225 Difference]: With dead ends: 399 [2025-03-04 11:35:06,810 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 11:35:06,813 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-04 11:35:06,815 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 34 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:06,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 867 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 11:35:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2025-03-04 11:35:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 150 states have (on average 1.58) internal successors, (237), 161 states have internal predecessors, (237), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 11:35:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 313 transitions. [2025-03-04 11:35:06,872 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 313 transitions. Word has length 11 [2025-03-04 11:35:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:06,872 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 313 transitions. [2025-03-04 11:35:06,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:35:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 313 transitions. [2025-03-04 11:35:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:35:06,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:06,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:06,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:35:06,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:06,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 279922782, now seen corresponding path program 1 times [2025-03-04 11:35:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:06,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473234977] [2025-03-04 11:35:06,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:06,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:35:06,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:35:06,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473234977] [2025-03-04 11:35:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473234977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655245182] [2025-03-04 11:35:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:06,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:06,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:06,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:06,993 INFO L87 Difference]: Start difference. First operand 203 states and 313 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:35:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:07,049 INFO L93 Difference]: Finished difference Result 429 states and 671 transitions. [2025-03-04 11:35:07,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:07,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 11:35:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:07,053 INFO L225 Difference]: With dead ends: 429 [2025-03-04 11:35:07,053 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 11:35:07,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:07,055 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 19 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 865 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-04 11:35:07,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 865 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 11:35:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-03-04 11:35:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 187 states have internal predecessors, (272), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 11:35:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2025-03-04 11:35:07,070 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 16 [2025-03-04 11:35:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:07,070 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2025-03-04 11:35:07,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:35:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2025-03-04 11:35:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:35:07,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:07,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:07,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:35:07,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:07,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2096074148, now seen corresponding path program 1 times [2025-03-04 11:35:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046564485] [2025-03-04 11:35:07,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:07,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:35:07,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:35:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:07,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046564485] [2025-03-04 11:35:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046564485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999256581] [2025-03-04 11:35:07,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:07,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:07,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:07,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:07,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:35:07,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:35:07,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:35:07,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:07,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:07,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:35:07,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:07,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999256581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:07,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:07,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 11:35:07,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359206347] [2025-03-04 11:35:07,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:07,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:07,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:07,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:07,358 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:35:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:07,396 INFO L93 Difference]: Finished difference Result 238 states and 364 transitions. [2025-03-04 11:35:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:07,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 11:35:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:07,399 INFO L225 Difference]: With dead ends: 238 [2025-03-04 11:35:07,399 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 11:35:07,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:07,399 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 19 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:07,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 11:35:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2025-03-04 11:35:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 186 states have internal predecessors, (269), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 11:35:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 355 transitions. [2025-03-04 11:35:07,425 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 355 transitions. Word has length 29 [2025-03-04 11:35:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:07,425 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 355 transitions. [2025-03-04 11:35:07,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:35:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 355 transitions. [2025-03-04 11:35:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:35:07,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:07,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:07,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:35:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:07,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 553789364, now seen corresponding path program 1 times [2025-03-04 11:35:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647854621] [2025-03-04 11:35:07,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:07,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:35:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:35:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:35:07,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647854621] [2025-03-04 11:35:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647854621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439516285] [2025-03-04 11:35:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:07,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:07,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:07,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:07,699 INFO L87 Difference]: Start difference. First operand 233 states and 355 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:35:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:07,723 INFO L93 Difference]: Finished difference Result 237 states and 361 transitions. [2025-03-04 11:35:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-04 11:35:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:07,726 INFO L225 Difference]: With dead ends: 237 [2025-03-04 11:35:07,728 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 11:35:07,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:07,729 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 18 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:07,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 829 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 11:35:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 203. [2025-03-04 11:35:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 152 states have (on average 1.5328947368421053) internal successors, (233), 161 states have internal predecessors, (233), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 11:35:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 309 transitions. [2025-03-04 11:35:07,749 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 309 transitions. Word has length 30 [2025-03-04 11:35:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:07,750 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 309 transitions. [2025-03-04 11:35:07,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:35:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 309 transitions. [2025-03-04 11:35:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:35:07,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:07,752 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:07,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:35:07,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:07,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1135142499, now seen corresponding path program 1 times [2025-03-04 11:35:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251599529] [2025-03-04 11:35:07,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:07,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:35:07,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:35:07,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:07,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 11:35:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251599529] [2025-03-04 11:35:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251599529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969138177] [2025-03-04 11:35:07,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:07,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:07,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:07,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:07,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:35:07,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:35:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:35:08,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:08,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:08,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:35:08,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:08,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969138177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:08,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:08,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 11:35:08,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168053410] [2025-03-04 11:35:08,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:08,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:08,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:08,077 INFO L87 Difference]: Start difference. First operand 203 states and 309 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:08,120 INFO L93 Difference]: Finished difference Result 355 states and 548 transitions. [2025-03-04 11:35:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:08,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2025-03-04 11:35:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:08,122 INFO L225 Difference]: With dead ends: 355 [2025-03-04 11:35:08,122 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 11:35:08,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:08,123 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 10 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:08,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 835 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 11:35:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-04 11:35:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 157 states have (on average 1.535031847133758) internal successors, (241), 167 states have internal predecessors, (241), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 11:35:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 319 transitions. [2025-03-04 11:35:08,136 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 319 transitions. Word has length 91 [2025-03-04 11:35:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:08,137 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 319 transitions. [2025-03-04 11:35:08,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 319 transitions. [2025-03-04 11:35:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 11:35:08,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:08,142 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:08,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:08,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:08,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:08,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:08,344 INFO L85 PathProgramCache]: Analyzing trace with hash -790192055, now seen corresponding path program 1 times [2025-03-04 11:35:08,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:08,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203748570] [2025-03-04 11:35:08,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:08,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:08,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 11:35:08,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 11:35:08,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:08,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:35:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203748570] [2025-03-04 11:35:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203748570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252812187] [2025-03-04 11:35:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:08,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:08,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:08,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:08,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:35:08,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 11:35:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 11:35:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:08,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:08,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:35:08,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252812187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 11:35:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023182438] [2025-03-04 11:35:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:08,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:08,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:08,681 INFO L87 Difference]: Start difference. First operand 210 states and 319 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:08,730 INFO L93 Difference]: Finished difference Result 369 states and 567 transitions. [2025-03-04 11:35:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2025-03-04 11:35:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:08,732 INFO L225 Difference]: With dead ends: 369 [2025-03-04 11:35:08,733 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 11:35:08,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:08,734 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 8 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:08,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 830 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 11:35:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-04 11:35:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.537037037037037) internal successors, (249), 173 states have internal predecessors, (249), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 11:35:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2025-03-04 11:35:08,747 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 93 [2025-03-04 11:35:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2025-03-04 11:35:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2025-03-04 11:35:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 11:35:08,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:08,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:08,756 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-04 11:35:08,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:08,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:08,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1815911517, now seen corresponding path program 1 times [2025-03-04 11:35:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:08,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308301129] [2025-03-04 11:35:08,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:08,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:35:08,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:35:08,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:08,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:35:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308301129] [2025-03-04 11:35:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308301129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316311652] [2025-03-04 11:35:09,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:09,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:09,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:09,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:09,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:35:09,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:35:09,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:35:09,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:09,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:09,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:09,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 11:35:09,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316311652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 11:35:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229474160] [2025-03-04 11:35:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:09,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:09,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:09,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:09,265 INFO L87 Difference]: Start difference. First operand 217 states and 329 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:09,363 INFO L93 Difference]: Finished difference Result 394 states and 617 transitions. [2025-03-04 11:35:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-04 11:35:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:09,365 INFO L225 Difference]: With dead ends: 394 [2025-03-04 11:35:09,365 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 11:35:09,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:09,366 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 39 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:09,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 791 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:09,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 11:35:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2025-03-04 11:35:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 185 states have internal predecessors, (270), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 11:35:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 352 transitions. [2025-03-04 11:35:09,380 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 352 transitions. Word has length 94 [2025-03-04 11:35:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:09,380 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 352 transitions. [2025-03-04 11:35:09,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 352 transitions. [2025-03-04 11:35:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 11:35:09,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:09,384 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:09,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:09,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:09,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 630094990, now seen corresponding path program 1 times [2025-03-04 11:35:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101805830] [2025-03-04 11:35:09,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:09,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:35:09,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:35:09,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:09,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-04 11:35:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101805830] [2025-03-04 11:35:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101805830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9021838] [2025-03-04 11:35:09,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:09,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:09,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:09,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:09,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:35:09,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:35:09,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:35:09,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:09,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:09,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:09,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:35:09,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9021838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:09,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:09,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 11:35:09,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245650493] [2025-03-04 11:35:09,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:09,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:09,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:09,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:09,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:09,871 INFO L87 Difference]: Start difference. First operand 231 states and 352 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:09,931 INFO L93 Difference]: Finished difference Result 468 states and 728 transitions. [2025-03-04 11:35:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:09,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-03-04 11:35:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:09,934 INFO L225 Difference]: With dead ends: 468 [2025-03-04 11:35:09,934 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 11:35:09,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:09,936 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 21 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:09,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 811 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 11:35:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-04 11:35:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 194 states have (on average 1.5670103092783505) internal successors, (304), 205 states have internal predecessors, (304), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 11:35:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 390 transitions. [2025-03-04 11:35:09,950 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 390 transitions. Word has length 97 [2025-03-04 11:35:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:09,950 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 390 transitions. [2025-03-04 11:35:09,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 390 transitions. [2025-03-04 11:35:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 11:35:09,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:09,956 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:09,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:10,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:10,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:10,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1026872664, now seen corresponding path program 1 times [2025-03-04 11:35:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:10,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195066169] [2025-03-04 11:35:10,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:10,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 11:35:10,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 11:35:10,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:10,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 11:35:10,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195066169] [2025-03-04 11:35:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195066169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335533734] [2025-03-04 11:35:10,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:10,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:10,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:10,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:35:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 11:35:10,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 11:35:10,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:10,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:10,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 11:35:10,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335533734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:10,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 11:35:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286952717] [2025-03-04 11:35:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:10,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:10,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:10,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:10,434 INFO L87 Difference]: Start difference. First operand 255 states and 390 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:10,488 INFO L93 Difference]: Finished difference Result 512 states and 793 transitions. [2025-03-04 11:35:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:10,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-04 11:35:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:10,490 INFO L225 Difference]: With dead ends: 512 [2025-03-04 11:35:10,491 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 11:35:10,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:10,492 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 19 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:10,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 798 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 11:35:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-04 11:35:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 221 states have internal predecessors, (330), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 11:35:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 420 transitions. [2025-03-04 11:35:10,511 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 420 transitions. Word has length 99 [2025-03-04 11:35:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:10,512 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 420 transitions. [2025-03-04 11:35:10,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 420 transitions. [2025-03-04 11:35:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:35:10,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:10,514 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:10,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:10,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:10,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:10,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash 828631373, now seen corresponding path program 1 times [2025-03-04 11:35:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:10,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861907606] [2025-03-04 11:35:10,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:10,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:10,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:35:10,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:35:10,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:10,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:35:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861907606] [2025-03-04 11:35:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861907606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093209830] [2025-03-04 11:35:10,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:10,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:10,817 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:10,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:35:10,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:35:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:35:10,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:10,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:10,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:10,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 11:35:10,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093209830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:10,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 11:35:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499270660] [2025-03-04 11:35:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:10,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:10,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:10,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:10,975 INFO L87 Difference]: Start difference. First operand 275 states and 420 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:11,004 INFO L93 Difference]: Finished difference Result 283 states and 435 transitions. [2025-03-04 11:35:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:11,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-03-04 11:35:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:11,007 INFO L225 Difference]: With dead ends: 283 [2025-03-04 11:35:11,007 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 11:35:11,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:11,007 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 12 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:11,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 846 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 11:35:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2025-03-04 11:35:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 220 states have internal predecessors, (329), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 11:35:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 419 transitions. [2025-03-04 11:35:11,018 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 419 transitions. Word has length 100 [2025-03-04 11:35:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 419 transitions. [2025-03-04 11:35:11,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 419 transitions. [2025-03-04 11:35:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 11:35:11,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:11,021 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:11,027 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-04 11:35:11,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:11,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:11,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -82231128, now seen corresponding path program 1 times [2025-03-04 11:35:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:11,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817112707] [2025-03-04 11:35:11,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:11,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 11:35:11,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 11:35:11,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:11,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:35:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817112707] [2025-03-04 11:35:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817112707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213088601] [2025-03-04 11:35:11,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:11,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:11,326 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:11,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:35:11,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 11:35:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 11:35:11,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:11,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:11,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:11,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 11:35:11,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213088601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:11,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:11,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 11:35:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487500757] [2025-03-04 11:35:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:11,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:11,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:11,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:11,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:11,485 INFO L87 Difference]: Start difference. First operand 274 states and 419 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:11,516 INFO L93 Difference]: Finished difference Result 470 states and 722 transitions. [2025-03-04 11:35:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-03-04 11:35:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:11,518 INFO L225 Difference]: With dead ends: 470 [2025-03-04 11:35:11,519 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 11:35:11,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:11,520 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 11 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:11,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 860 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 11:35:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-04 11:35:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 219 states have (on average 1.5616438356164384) internal successors, (342), 228 states have internal predecessors, (342), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 11:35:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 436 transitions. [2025-03-04 11:35:11,530 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 436 transitions. Word has length 101 [2025-03-04 11:35:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:11,530 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 436 transitions. [2025-03-04 11:35:11,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 11:35:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 436 transitions. [2025-03-04 11:35:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 11:35:11,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:11,532 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:11,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:35:11,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:35:11,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:11,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1263484437, now seen corresponding path program 1 times [2025-03-04 11:35:11,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:11,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433009802] [2025-03-04 11:35:11,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:11,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:11,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 11:35:11,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 11:35:11,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:35:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433009802] [2025-03-04 11:35:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433009802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508514647] [2025-03-04 11:35:11,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:11,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:11,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:11,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:35:11,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 11:35:11,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 11:35:11,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:11,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:11,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:11,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:35:11,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:11,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508514647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:11,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:11,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 11:35:11,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401102234] [2025-03-04 11:35:11,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:11,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:11,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:11,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:11,968 INFO L87 Difference]: Start difference. First operand 284 states and 436 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:35:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:11,999 INFO L93 Difference]: Finished difference Result 295 states and 455 transitions. [2025-03-04 11:35:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-03-04 11:35:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:12,001 INFO L225 Difference]: With dead ends: 295 [2025-03-04 11:35:12,001 INFO L226 Difference]: Without dead ends: 294 [2025-03-04 11:35:12,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:12,002 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 10 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:12,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 845 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-04 11:35:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 285. [2025-03-04 11:35:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.559090909090909) internal successors, (343), 229 states have internal predecessors, (343), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 11:35:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 437 transitions. [2025-03-04 11:35:12,012 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 437 transitions. Word has length 108 [2025-03-04 11:35:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:12,012 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 437 transitions. [2025-03-04 11:35:12,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:35:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 437 transitions. [2025-03-04 11:35:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 11:35:12,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:12,014 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:12,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:12,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:12,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:12,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash -513311806, now seen corresponding path program 1 times [2025-03-04 11:35:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860757068] [2025-03-04 11:35:12,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:12,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 11:35:12,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 11:35:12,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:12,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:35:12,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:12,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860757068] [2025-03-04 11:35:12,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860757068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:12,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700207542] [2025-03-04 11:35:12,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:12,307 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:12,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:35:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 11:35:12,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 11:35:12,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:12,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:12,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:12,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:35:12,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700207542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 11:35:12,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234397121] [2025-03-04 11:35:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:12,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:12,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:12,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:12,472 INFO L87 Difference]: Start difference. First operand 285 states and 437 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:35:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:12,499 INFO L93 Difference]: Finished difference Result 287 states and 439 transitions. [2025-03-04 11:35:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:12,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-04 11:35:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:12,501 INFO L225 Difference]: With dead ends: 287 [2025-03-04 11:35:12,501 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 11:35:12,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:12,502 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 9 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:12,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 847 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 11:35:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-03-04 11:35:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5565610859728507) internal successors, (344), 230 states have internal predecessors, (344), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 11:35:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2025-03-04 11:35:12,514 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 109 [2025-03-04 11:35:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2025-03-04 11:35:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:35:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2025-03-04 11:35:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 11:35:12,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:12,517 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:12,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:12,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:35:12,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:12,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1093253678, now seen corresponding path program 1 times [2025-03-04 11:35:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:12,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812922203] [2025-03-04 11:35:12,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:12,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:35:12,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:35:12,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:12,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:35:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812922203] [2025-03-04 11:35:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812922203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:12,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612594191] [2025-03-04 11:35:12,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:12,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:12,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:12,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:12,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:35:12,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:35:12,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:35:12,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:12,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:12,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:35:12,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:35:12,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612594191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:35:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865182822] [2025-03-04 11:35:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:12,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:12,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:12,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:12,971 INFO L87 Difference]: Start difference. First operand 286 states and 438 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:35:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:13,006 INFO L93 Difference]: Finished difference Result 291 states and 448 transitions. [2025-03-04 11:35:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:13,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-03-04 11:35:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:13,009 INFO L225 Difference]: With dead ends: 291 [2025-03-04 11:35:13,009 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 11:35:13,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:13,010 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 12 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:13,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1075 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 11:35:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 285. [2025-03-04 11:35:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 221 states have (on average 1.5520361990950227) internal successors, (343), 229 states have internal predecessors, (343), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 11:35:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 437 transitions. [2025-03-04 11:35:13,024 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 437 transitions. Word has length 110 [2025-03-04 11:35:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:13,024 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 437 transitions. [2025-03-04 11:35:13,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:35:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 437 transitions. [2025-03-04 11:35:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 11:35:13,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:13,027 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:13,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:35:13,231 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:13,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash -468874273, now seen corresponding path program 1 times [2025-03-04 11:35:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570137732] [2025-03-04 11:35:13,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:13,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 11:35:13,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 11:35:13,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:13,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:35:13,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570137732] [2025-03-04 11:35:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570137732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407182283] [2025-03-04 11:35:13,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:13,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:13,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:13,324 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:13,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:35:13,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 11:35:13,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 11:35:13,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:13,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:13,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:35:13,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:35:13,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407182283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:13,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-04 11:35:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915348317] [2025-03-04 11:35:13,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:13,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:13,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:13,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:13,528 INFO L87 Difference]: Start difference. First operand 285 states and 437 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 11:35:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:13,572 INFO L93 Difference]: Finished difference Result 489 states and 753 transitions. [2025-03-04 11:35:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-03-04 11:35:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:13,576 INFO L225 Difference]: With dead ends: 489 [2025-03-04 11:35:13,577 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 11:35:13,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:13,579 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 21 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:13,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1131 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 11:35:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2025-03-04 11:35:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5580357142857142) internal successors, (349), 231 states have internal predecessors, (349), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 11:35:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 445 transitions. [2025-03-04 11:35:13,590 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 445 transitions. Word has length 111 [2025-03-04 11:35:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:13,590 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 445 transitions. [2025-03-04 11:35:13,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 11:35:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 445 transitions. [2025-03-04 11:35:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 11:35:13,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:13,592 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:13,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:35:13,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:35:13,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:13,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash -444879159, now seen corresponding path program 1 times [2025-03-04 11:35:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254150514] [2025-03-04 11:35:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:13,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 11:35:13,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:35:13,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:13,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:35:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:13,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254150514] [2025-03-04 11:35:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254150514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:13,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731208109] [2025-03-04 11:35:13,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:13,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:13,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:13,888 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:13,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:35:13,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 11:35:14,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:35:14,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:14,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:14,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:14,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:35:14,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731208109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:14,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:14,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 11:35:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892923361] [2025-03-04 11:35:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:14,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:14,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:14,050 INFO L87 Difference]: Start difference. First operand 288 states and 445 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:14,088 INFO L93 Difference]: Finished difference Result 297 states and 460 transitions. [2025-03-04 11:35:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-03-04 11:35:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:14,090 INFO L225 Difference]: With dead ends: 297 [2025-03-04 11:35:14,092 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:35:14,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:14,093 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 8 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:14,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 854 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:35:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 289. [2025-03-04 11:35:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 232 states have internal predecessors, (350), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 11:35:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 446 transitions. [2025-03-04 11:35:14,102 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 446 transitions. Word has length 116 [2025-03-04 11:35:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:14,102 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 446 transitions. [2025-03-04 11:35:14,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 446 transitions. [2025-03-04 11:35:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 11:35:14,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:14,105 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:14,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:14,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:35:14,306 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:14,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash -906351972, now seen corresponding path program 1 times [2025-03-04 11:35:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728030602] [2025-03-04 11:35:14,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:14,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 11:35:14,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 11:35:14,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:14,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:35:14,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728030602] [2025-03-04 11:35:14,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728030602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155133880] [2025-03-04 11:35:14,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:14,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:14,388 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:14,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:35:14,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 11:35:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 11:35:14,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:14,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:14,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:14,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:35:14,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155133880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:14,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:14,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 11:35:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210023996] [2025-03-04 11:35:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:14,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:14,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:14,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:14,549 INFO L87 Difference]: Start difference. First operand 289 states and 446 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:14,601 INFO L93 Difference]: Finished difference Result 292 states and 449 transitions. [2025-03-04 11:35:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:14,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2025-03-04 11:35:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:14,603 INFO L225 Difference]: With dead ends: 292 [2025-03-04 11:35:14,603 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 11:35:14,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:14,604 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 7 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:14,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 843 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 11:35:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2025-03-04 11:35:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5530973451327434) internal successors, (351), 233 states have internal predecessors, (351), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 11:35:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 447 transitions. [2025-03-04 11:35:14,613 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 447 transitions. Word has length 117 [2025-03-04 11:35:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:14,613 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 447 transitions. [2025-03-04 11:35:14,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 447 transitions. [2025-03-04 11:35:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:35:14,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:14,615 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:14,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:35:14,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:14,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:14,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1822051316, now seen corresponding path program 1 times [2025-03-04 11:35:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824427229] [2025-03-04 11:35:14,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:14,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:14,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:14,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:14,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:14,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:35:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824427229] [2025-03-04 11:35:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824427229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:14,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714464118] [2025-03-04 11:35:14,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:14,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:14,916 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:14,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:35:14,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:15,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:15,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:15,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:15,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:35:15,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:35:15,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714464118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:35:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865278869] [2025-03-04 11:35:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:15,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:15,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:15,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:15,091 INFO L87 Difference]: Start difference. First operand 290 states and 447 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:15,133 INFO L93 Difference]: Finished difference Result 298 states and 461 transitions. [2025-03-04 11:35:15,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:15,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2025-03-04 11:35:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:15,135 INFO L225 Difference]: With dead ends: 298 [2025-03-04 11:35:15,135 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 11:35:15,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:15,136 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 10 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:15,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1076 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 11:35:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2025-03-04 11:35:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.550660792951542) internal successors, (352), 234 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 11:35:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 448 transitions. [2025-03-04 11:35:15,145 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 448 transitions. Word has length 118 [2025-03-04 11:35:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 448 transitions. [2025-03-04 11:35:15,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 448 transitions. [2025-03-04 11:35:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:35:15,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:15,147 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:15,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:15,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:35:15,348 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:15,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:15,348 INFO L85 PathProgramCache]: Analyzing trace with hash 647591564, now seen corresponding path program 1 times [2025-03-04 11:35:15,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:15,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420051906] [2025-03-04 11:35:15,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:15,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:15,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:15,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:15,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:15,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:35:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:15,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420051906] [2025-03-04 11:35:15,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420051906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:15,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017930257] [2025-03-04 11:35:15,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:15,422 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:15,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:35:15,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:15,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:15,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:15,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:15,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:35:15,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:35:15,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017930257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:15,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:35:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501163412] [2025-03-04 11:35:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:15,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:15,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:15,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:15,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:15,580 INFO L87 Difference]: Start difference. First operand 291 states and 448 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:15,621 INFO L93 Difference]: Finished difference Result 299 states and 462 transitions. [2025-03-04 11:35:15,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:15,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2025-03-04 11:35:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:15,624 INFO L225 Difference]: With dead ends: 299 [2025-03-04 11:35:15,624 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 11:35:15,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:15,625 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 12 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:15,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1119 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 11:35:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 289. [2025-03-04 11:35:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 226 states have (on average 1.5486725663716814) internal successors, (350), 232 states have internal predecessors, (350), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 11:35:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 446 transitions. [2025-03-04 11:35:15,635 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 446 transitions. Word has length 118 [2025-03-04 11:35:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:15,636 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 446 transitions. [2025-03-04 11:35:15,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:35:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 446 transitions. [2025-03-04 11:35:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 11:35:15,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:15,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:15,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:15,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:15,838 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:15,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash -649015879, now seen corresponding path program 1 times [2025-03-04 11:35:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:15,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764275950] [2025-03-04 11:35:15,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:15,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:15,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:35:15,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:35:15,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:15,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:35:15,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:15,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764275950] [2025-03-04 11:35:15,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764275950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:15,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6455591] [2025-03-04 11:35:15,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:15,925 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:15,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:35:16,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:35:16,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:35:16,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:16,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:16,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:35:16,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:35:16,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6455591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:16,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:16,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-04 11:35:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182381646] [2025-03-04 11:35:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:16,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:16,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:16,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:16,138 INFO L87 Difference]: Start difference. First operand 289 states and 446 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 11:35:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:16,183 INFO L93 Difference]: Finished difference Result 294 states and 452 transitions. [2025-03-04 11:35:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:16,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2025-03-04 11:35:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:16,185 INFO L225 Difference]: With dead ends: 294 [2025-03-04 11:35:16,186 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 11:35:16,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:16,187 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 19 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:16,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1156 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 11:35:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2025-03-04 11:35:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 226 states have (on average 1.5486725663716814) internal successors, (350), 232 states have internal predecessors, (350), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 11:35:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 446 transitions. [2025-03-04 11:35:16,198 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 446 transitions. Word has length 119 [2025-03-04 11:35:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 446 transitions. [2025-03-04 11:35:16,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 11:35:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 446 transitions. [2025-03-04 11:35:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 11:35:16,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:16,201 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:16,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:35:16,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:16,401 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1399497927, now seen corresponding path program 1 times [2025-03-04 11:35:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:16,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130800534] [2025-03-04 11:35:16,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:16,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:35:16,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:35:16,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:16,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:35:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130800534] [2025-03-04 11:35:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130800534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156460389] [2025-03-04 11:35:16,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:16,482 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:16,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:35:16,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:35:16,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:35:16,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:16,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:16,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:35:16,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:35:16,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156460389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-04 11:35:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014622265] [2025-03-04 11:35:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:16,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:16,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:16,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:16,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:16,658 INFO L87 Difference]: Start difference. First operand 289 states and 446 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 11:35:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:16,703 INFO L93 Difference]: Finished difference Result 505 states and 779 transitions. [2025-03-04 11:35:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2025-03-04 11:35:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:16,707 INFO L225 Difference]: With dead ends: 505 [2025-03-04 11:35:16,707 INFO L226 Difference]: Without dead ends: 304 [2025-03-04 11:35:16,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:16,708 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 17 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:16,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1177 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-04 11:35:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 291. [2025-03-04 11:35:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 228 states have (on average 1.543859649122807) internal successors, (352), 234 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 11:35:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 448 transitions. [2025-03-04 11:35:16,718 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 448 transitions. Word has length 119 [2025-03-04 11:35:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 448 transitions. [2025-03-04 11:35:16,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 11:35:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 448 transitions. [2025-03-04 11:35:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 11:35:16,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:16,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:16,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:35:16,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:16,921 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:16,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1087351574, now seen corresponding path program 1 times [2025-03-04 11:35:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069203900] [2025-03-04 11:35:16,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:16,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 11:35:16,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 11:35:16,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:16,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:35:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069203900] [2025-03-04 11:35:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069203900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:16,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635733907] [2025-03-04 11:35:16,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:16,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:16,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:16,992 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:16,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:35:17,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 11:35:17,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 11:35:17,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:17,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:17,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:17,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:35:17,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635733907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:17,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:17,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-03-04 11:35:17,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267087278] [2025-03-04 11:35:17,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:17,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:17,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:17,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:35:17,179 INFO L87 Difference]: Start difference. First operand 291 states and 448 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-04 11:35:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:17,245 INFO L93 Difference]: Finished difference Result 305 states and 473 transitions. [2025-03-04 11:35:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:35:17,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 121 [2025-03-04 11:35:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:17,248 INFO L225 Difference]: With dead ends: 305 [2025-03-04 11:35:17,248 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:35:17,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:35:17,250 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 28 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:17,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1686 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:35:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:35:17,250 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-04 11:35:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:35:17,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2025-03-04 11:35:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:17,251 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:35:17,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-04 11:35:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:35:17,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:35:17,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 11:35:17,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 11:35:17,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 11:35:17,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 11:35:17,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 11:35:17,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 11:35:17,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 11:35:17,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 11:35:17,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:17,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:17,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:17,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:35:17,717 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:35:17,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:35:17 BoogieIcfgContainer [2025-03-04 11:35:17,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:35:17,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:35:17,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:35:17,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:35:17,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:06" (3/4) ... [2025-03-04 11:35:17,731 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:35:17,736 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2025-03-04 11:35:17,736 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2025-03-04 11:35:17,736 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assert [2025-03-04 11:35:17,736 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure add_history_type [2025-03-04 11:35:17,736 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:35:17,736 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2025-03-04 11:35:17,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-04 11:35:17,748 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 11:35:17,748 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:35:17,749 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:35:17,773 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2025-03-04 11:35:17,815 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2025-03-04 11:35:17,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:35:17,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:35:17,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:35:17,848 INFO L158 Benchmark]: Toolchain (without parser) took 12531.48ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 103.6MB in the beginning and 298.2MB in the end (delta: -194.6MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,848 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:17,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.97ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 86.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.85ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,848 INFO L158 Benchmark]: Boogie Preprocessor took 47.76ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 80.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:17,849 INFO L158 Benchmark]: IcfgBuilder took 650.45ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 42.0MB in the end (delta: 38.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,849 INFO L158 Benchmark]: TraceAbstraction took 11368.49ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 42.0MB in the beginning and 306.4MB in the end (delta: -264.4MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,849 INFO L158 Benchmark]: Witness Printer took 117.62ms. Allocated memory is still 385.9MB. Free memory was 306.4MB in the beginning and 298.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,850 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.92ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.97ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 86.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.85ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.76ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 80.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 650.45ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 42.0MB in the end (delta: 38.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11368.49ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 42.0MB in the beginning and 306.4MB in the end (delta: -264.4MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. * Witness Printer took 117.62ms. Allocated memory is still 385.9MB. Free memory was 306.4MB in the beginning and 298.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: 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 7 procedures, 192 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 21252 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14948 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 6304 mSDtfsCounter, 1000 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2085 GetRequests, 1945 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=18, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 117 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3997 NumberOfCodeBlocks, 3997 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3956 ConstructedInterpolants, 0 QuantifiedInterpolants, 4576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10605 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 1814/1875 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 8 specifications checked. All of them hold - InvariantResult [Line: 74]: Location Invariant Derived location invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:35:17,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE