./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 0d89175118588f94b41189db429a365e86ead2182459163ed220a3d9e791f611 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:36:56,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:36:56,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 12:36:56,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:36:56,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:36:56,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:36:56,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:36:56,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:36:56,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:36:56,797 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:36:56,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:36:56,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:36:56,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:36:56,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:36:56,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:36:56,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:36:56,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:36:56,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:36:56,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:36:56,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 12:36:56,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 12:36:56,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:36:56,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:36:56,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:36:56,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:36:56,800 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d89175118588f94b41189db429a365e86ead2182459163ed220a3d9e791f611 [2025-03-04 12:36:57,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:36:57,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:36:57,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:36:57,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:36:57,027 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:36:57,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_good.i [2025-03-04 12:36:58,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab49d299a/85ea968ab1d24126a65a60e1dab62812/FLAG1a7e9e843 [2025-03-04 12:36:58,469 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:36:58,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_11_good.i [2025-03-04 12:36:58,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab49d299a/85ea968ab1d24126a65a60e1dab62812/FLAG1a7e9e843 [2025-03-04 12:36:58,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab49d299a/85ea968ab1d24126a65a60e1dab62812 [2025-03-04 12:36:58,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:36:58,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:36:58,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:36:58,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:36:58,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:36:58,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:58" (1/1) ... [2025-03-04 12:36:58,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:58, skipping insertion in model container [2025-03-04 12:36:58,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:58" (1/1) ... [2025-03-04 12:36:58,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:36:59,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:36:59,194 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:36:59,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:36:59,371 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:36:59,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59 WrapperNode [2025-03-04 12:36:59,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:36:59,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:36:59,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:36:59,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:36:59,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,431 INFO L138 Inliner]: procedures = 502, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 169 [2025-03-04 12:36:59,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:36:59,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:36:59,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:36:59,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:36:59,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-03-04 12:36:59,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:36:59,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:36:59,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:36:59,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:36:59,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 12:36:59,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:36:59,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:36:59,516 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 12:36:59,518 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 12:36:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:36:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:36:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:36:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:36:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2025-03-04 12:36:59,536 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2025-03-04 12:36:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:36:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:36:59,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:36:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2025-03-04 12:36:59,536 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2025-03-04 12:36:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 12:36:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 12:36:59,657 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:36:59,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:36:59,843 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-04 12:36:59,843 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:36:59,849 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:36:59,868 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:36:59,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:59 BoogieIcfgContainer [2025-03-04 12:36:59,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:36:59,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:36:59,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:36:59,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:36:59,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:36:58" (1/3) ... [2025-03-04 12:36:59,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eee9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:59, skipping insertion in model container [2025-03-04 12:36:59,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (2/3) ... [2025-03-04 12:36:59,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eee9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:59, skipping insertion in model container [2025-03-04 12:36:59,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:59" (3/3) ... [2025-03-04 12:36:59,876 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_11_good.i [2025-03-04 12:36:59,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:36:59,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_preinc_11_good.i that has 5 procedures, 87 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 12:36:59,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:36:59,943 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;@48d55da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:36:59,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 12:36:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 12:36:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 12:36:59,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:59,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:36:59,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:36:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 33246381, now seen corresponding path program 1 times [2025-03-04 12:36:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:36:59,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921696077] [2025-03-04 12:36:59,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:00,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 12:37:00,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 12:37:00,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:00,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:00,268 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 12:37:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921696077] [2025-03-04 12:37:00,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921696077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:00,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:37:00,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 12:37:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485206926] [2025-03-04 12:37:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:37:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:00,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:37:00,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:37:00,290 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:37:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:00,326 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2025-03-04 12:37:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:37:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 12:37:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:00,335 INFO L225 Difference]: With dead ends: 164 [2025-03-04 12:37:00,338 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 12:37:00,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:37:00,343 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:00,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 331 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 12:37:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-04 12:37:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 12:37:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-03-04 12:37:00,384 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 22 [2025-03-04 12:37:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-03-04 12:37:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:37:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-03-04 12:37:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 12:37:00,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:00,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:37:00,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 12:37:00,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 673732907, now seen corresponding path program 1 times [2025-03-04 12:37:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:00,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164575620] [2025-03-04 12:37:00,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:00,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 12:37:00,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 12:37:00,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:00,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:00,516 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 12:37:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164575620] [2025-03-04 12:37:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164575620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:00,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:37:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:37:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347614793] [2025-03-04 12:37:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:00,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:00,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:00,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:00,518 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:37:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:00,566 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2025-03-04 12:37:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-03-04 12:37:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:00,567 INFO L225 Difference]: With dead ends: 79 [2025-03-04 12:37:00,568 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 12:37:00,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:00,570 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 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 12:37:00,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 12:37:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-03-04 12:37:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 12:37:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2025-03-04 12:37:00,584 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 24 [2025-03-04 12:37:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:00,584 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2025-03-04 12:37:00,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:37:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2025-03-04 12:37:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 12:37:00,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:00,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:37:00,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 12:37:00,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:00,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash -589116322, now seen corresponding path program 1 times [2025-03-04 12:37:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:00,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594397113] [2025-03-04 12:37:00,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:00,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:00,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 12:37:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 12:37:00,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:00,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:00,672 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 12:37:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:00,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594397113] [2025-03-04 12:37:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594397113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:00,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:37:00,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:37:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969029655] [2025-03-04 12:37:00,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:00,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:00,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:00,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:00,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:00,676 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:37:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:00,711 INFO L93 Difference]: Finished difference Result 141 states and 184 transitions. [2025-03-04 12:37:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-04 12:37:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:00,714 INFO L225 Difference]: With dead ends: 141 [2025-03-04 12:37:00,714 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 12:37:00,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:00,716 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:00,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 12:37:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-03-04 12:37:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 62 states have internal predecessors, (69), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 12:37:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2025-03-04 12:37:00,731 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 25 [2025-03-04 12:37:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:00,731 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2025-03-04 12:37:00,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:37:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2025-03-04 12:37:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 12:37:00,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:00,732 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 12:37:00,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 12:37:00,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:00,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1645962576, now seen corresponding path program 1 times [2025-03-04 12:37:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:00,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024645557] [2025-03-04 12:37:00,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:00,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 12:37:00,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 12:37:00,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:00,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:37:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:00,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024645557] [2025-03-04 12:37:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024645557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:00,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:37:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 12:37:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841119977] [2025-03-04 12:37:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:00,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:37:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:00,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:37:00,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:37:00,835 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:00,861 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2025-03-04 12:37:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:37:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2025-03-04 12:37:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:00,863 INFO L225 Difference]: With dead ends: 137 [2025-03-04 12:37:00,863 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 12:37:00,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:37:00,864 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:00,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 12:37:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 12:37:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 61 states have internal predecessors, (67), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 12:37:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2025-03-04 12:37:00,872 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 42 [2025-03-04 12:37:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:00,873 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2025-03-04 12:37:00,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2025-03-04 12:37:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 12:37:00,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:00,874 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 12:37:00,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 12:37:00,874 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 12:37:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1597229595, now seen corresponding path program 1 times [2025-03-04 12:37:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115988462] [2025-03-04 12:37:00,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:00,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 12:37:00,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 12:37:00,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 12:37:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115988462] [2025-03-04 12:37:01,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115988462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450400179] [2025-03-04 12:37:01,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:01,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:01,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:01,005 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 12:37:01,009 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 12:37:01,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 12:37:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 12:37:01,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:01,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:01,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:01,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:37:01,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450400179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:01,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:01,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549077248] [2025-03-04 12:37:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:01,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:01,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:01,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:01,174 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:01,196 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2025-03-04 12:37:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2025-03-04 12:37:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:01,198 INFO L225 Difference]: With dead ends: 89 [2025-03-04 12:37:01,200 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 12:37:01,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:01,201 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:01,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 175 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 12:37:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-03-04 12:37:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 65 states have internal predecessors, (74), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 12:37:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2025-03-04 12:37:01,207 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 43 [2025-03-04 12:37:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:01,207 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2025-03-04 12:37:01,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2025-03-04 12:37:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 12:37:01,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:01,208 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 12:37:01,215 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 12:37:01,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:01,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:01,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2025490124, now seen corresponding path program 1 times [2025-03-04 12:37:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378349468] [2025-03-04 12:37:01,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:01,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 12:37:01,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 12:37:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 12:37:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:01,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378349468] [2025-03-04 12:37:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378349468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:01,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316791279] [2025-03-04 12:37:01,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:01,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:01,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:01,497 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 12:37:01,499 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 12:37:01,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 12:37:01,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 12:37:01,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:01,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:01,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:01,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:37:01,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:01,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316791279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:01,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:01,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:01,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84081966] [2025-03-04 12:37:01,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:01,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:01,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:01,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:01,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:01,603 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:01,626 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2025-03-04 12:37:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-03-04 12:37:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:01,627 INFO L225 Difference]: With dead ends: 128 [2025-03-04 12:37:01,627 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 12:37:01,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:01,628 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:01,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 185 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 12:37:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-04 12:37:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 66 states have internal predecessors, (74), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 12:37:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2025-03-04 12:37:01,640 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 44 [2025-03-04 12:37:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:01,640 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2025-03-04 12:37:01,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2025-03-04 12:37:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 12:37:01,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:01,642 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 12:37:01,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 12:37:01,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 12:37:01,842 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 12:37:01,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash -695739069, now seen corresponding path program 1 times [2025-03-04 12:37:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:01,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969557827] [2025-03-04 12:37:01,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:01,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 12:37:01,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 12:37:01,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:01,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:37:01,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:01,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969557827] [2025-03-04 12:37:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969557827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:01,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:37:01,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:37:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869038694] [2025-03-04 12:37:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:01,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:01,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:01,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:01,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:01,898 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:01,910 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2025-03-04 12:37:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:01,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2025-03-04 12:37:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:01,911 INFO L225 Difference]: With dead ends: 88 [2025-03-04 12:37:01,911 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 12:37:01,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:01,912 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:01,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 168 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 12:37:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-04 12:37:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 65 states have internal predecessors, (73), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 12:37:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2025-03-04 12:37:01,916 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 45 [2025-03-04 12:37:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:01,917 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2025-03-04 12:37:01,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:37:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2025-03-04 12:37:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 12:37:01,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:01,917 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 12:37:01,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 12:37:01,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:01,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash -93074642, now seen corresponding path program 1 times [2025-03-04 12:37:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778094292] [2025-03-04 12:37:01,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:01,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 12:37:01,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 12:37:01,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:01,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:37:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:01,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778094292] [2025-03-04 12:37:01,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778094292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:01,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:37:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:37:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783989551] [2025-03-04 12:37:01,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:01,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:01,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:01,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:01,968 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 12:37:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:01,980 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2025-03-04 12:37:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2025-03-04 12:37:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:01,981 INFO L225 Difference]: With dead ends: 87 [2025-03-04 12:37:01,981 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 12:37:01,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:37:01,981 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 8 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:01,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 181 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 12:37:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2025-03-04 12:37:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 12:37:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-03-04 12:37:01,986 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 46 [2025-03-04 12:37:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:01,986 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-04 12:37:01,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 12:37:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2025-03-04 12:37:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 12:37:01,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:01,987 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-03-04 12:37:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 12:37:01,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash -226185567, now seen corresponding path program 1 times [2025-03-04 12:37:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332204714] [2025-03-04 12:37:01,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:01,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 12:37:01,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 12:37:01,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:01,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 12:37:02,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:02,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332204714] [2025-03-04 12:37:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332204714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065275633] [2025-03-04 12:37:02,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:02,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:02,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:02,055 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 12:37:02,056 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 12:37:02,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 12:37:02,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 12:37:02,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:02,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:02,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:02,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 12:37:02,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065275633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:02,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684869299] [2025-03-04 12:37:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:02,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:02,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:02,159 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 12:37:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:02,170 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2025-03-04 12:37:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:02,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-04 12:37:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:02,172 INFO L225 Difference]: With dead ends: 90 [2025-03-04 12:37:02,172 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 12:37:02,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:02,173 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:02,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 12:37:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-04 12:37:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 64 states have internal predecessors, (74), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 12:37:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2025-03-04 12:37:02,184 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 55 [2025-03-04 12:37:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:02,184 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2025-03-04 12:37:02,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 12:37:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2025-03-04 12:37:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 12:37:02,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:02,185 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-03-04 12:37:02,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 12:37:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:02,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1578182016, now seen corresponding path program 1 times [2025-03-04 12:37:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350373678] [2025-03-04 12:37:02,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:02,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 12:37:02,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 12:37:02,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:02,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 12:37:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350373678] [2025-03-04 12:37:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350373678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014305023] [2025-03-04 12:37:02,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:02,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:02,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:02,467 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 12:37:02,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 12:37:02,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 12:37:02,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 12:37:02,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:02,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:02,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:02,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 12:37:02,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014305023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183395150] [2025-03-04 12:37:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:02,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:02,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:02,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:02,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:02,603 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 12:37:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:02,618 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2025-03-04 12:37:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:02,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2025-03-04 12:37:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:02,619 INFO L225 Difference]: With dead ends: 88 [2025-03-04 12:37:02,620 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 12:37:02,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:02,621 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:02,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 12:37:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-04 12:37:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 63 states have internal predecessors, (73), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 12:37:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2025-03-04 12:37:02,629 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 113 transitions. Word has length 56 [2025-03-04 12:37:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:02,629 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 113 transitions. [2025-03-04 12:37:02,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 12:37:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2025-03-04 12:37:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 12:37:02,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:02,635 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2025-03-04 12:37:02,641 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 12:37:02,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:02,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:02,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash 143917266, now seen corresponding path program 1 times [2025-03-04 12:37:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:02,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315356842] [2025-03-04 12:37:02,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:02,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 12:37:02,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 12:37:02,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:02,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 12:37:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315356842] [2025-03-04 12:37:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315356842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080062512] [2025-03-04 12:37:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:02,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:02,905 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 12:37:02,906 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 12:37:02,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 12:37:02,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 12:37:02,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:02,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:02,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:02,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 12:37:03,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080062512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666992925] [2025-03-04 12:37:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:03,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:03,010 INFO L87 Difference]: Start difference. First operand 86 states and 113 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 12:37:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:03,022 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2025-03-04 12:37:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:03,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2025-03-04 12:37:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:03,025 INFO L225 Difference]: With dead ends: 87 [2025-03-04 12:37:03,025 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 12:37:03,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:03,026 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:03,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 12:37:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2025-03-04 12:37:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 60 states have internal predecessors, (68), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 12:37:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2025-03-04 12:37:03,032 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 60 [2025-03-04 12:37:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:03,033 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-03-04 12:37:03,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 12:37:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2025-03-04 12:37:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 12:37:03,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:03,039 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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] [2025-03-04 12:37:03,046 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 12:37:03,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 12:37:03,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:03,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1613505763, now seen corresponding path program 1 times [2025-03-04 12:37:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:03,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554606924] [2025-03-04 12:37:03,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:03,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 12:37:03,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 12:37:03,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:03,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 12:37:03,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554606924] [2025-03-04 12:37:03,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554606924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310042124] [2025-03-04 12:37:03,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:03,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:03,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:03,306 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 12:37:03,308 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 12:37:03,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 12:37:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 12:37:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:03,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:03,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 12:37:03,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310042124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:03,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:03,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:03,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587916504] [2025-03-04 12:37:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:03,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:03,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:03,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:03,409 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:37:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:03,423 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2025-03-04 12:37:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2025-03-04 12:37:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:03,426 INFO L225 Difference]: With dead ends: 87 [2025-03-04 12:37:03,426 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 12:37:03,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:03,426 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:03,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 12:37:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-03-04 12:37:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 12:37:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2025-03-04 12:37:03,432 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 68 [2025-03-04 12:37:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:03,432 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2025-03-04 12:37:03,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:37:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2025-03-04 12:37:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 12:37:03,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:03,433 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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] [2025-03-04 12:37:03,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 12:37:03,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:03,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 129304572, now seen corresponding path program 1 times [2025-03-04 12:37:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342847085] [2025-03-04 12:37:03,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 12:37:03,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 12:37:03,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:03,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 12:37:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342847085] [2025-03-04 12:37:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342847085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969495373] [2025-03-04 12:37:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:03,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:03,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:03,706 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 12:37:03,708 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 12:37:03,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 12:37:03,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 12:37:03,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:03,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:03,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:03,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 12:37:03,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969495373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:03,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:03,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662147523] [2025-03-04 12:37:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:03,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:03,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:03,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:03,837 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:37:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:03,849 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2025-03-04 12:37:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:03,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2025-03-04 12:37:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:03,850 INFO L225 Difference]: With dead ends: 85 [2025-03-04 12:37:03,850 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 12:37:03,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:03,851 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:03,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 12:37:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-03-04 12:37:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 12:37:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-03-04 12:37:03,856 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 68 [2025-03-04 12:37:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:03,856 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-03-04 12:37:03,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:37:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-03-04 12:37:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 12:37:03,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:37:03,857 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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] [2025-03-04 12:37:03,864 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 12:37:04,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:04,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:37:04,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:37:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1520928885, now seen corresponding path program 1 times [2025-03-04 12:37:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:37:04,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026856063] [2025-03-04 12:37:04,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:04,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:37:04,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 12:37:04,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 12:37:04,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:04,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 12:37:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:37:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026856063] [2025-03-04 12:37:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026856063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:37:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381585404] [2025-03-04 12:37:04,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:37:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:37:04,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:37:04,107 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 12:37:04,109 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 12:37:04,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 12:37:04,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 12:37:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:37:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:37:04,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 12:37:04,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:37:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 12:37:04,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:37:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381585404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:37:04,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:37:04,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 12:37:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391621233] [2025-03-04 12:37:04,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:37:04,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:37:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:37:04,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:37:04,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:04,215 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:37:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:37:04,223 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2025-03-04 12:37:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:37:04,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-04 12:37:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:37:04,223 INFO L225 Difference]: With dead ends: 80 [2025-03-04 12:37:04,223 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 12:37:04,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 12:37:04,224 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:37:04,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 172 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:37:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 12:37:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 12:37:04,225 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 12:37:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 12:37:04,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2025-03-04 12:37:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:37:04,225 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 12:37:04,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:37:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 12:37:04,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 12:37:04,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 12:37:04,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 12:37:04,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 12:37:04,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 12:37:04,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 12:37:04,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 12:37:04,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 12:37:04,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 12:37:04,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 12:37:04,431 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,SelfDestructingSolverStorable13 [2025-03-04 12:37:04,433 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:37:04,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 12:37:04,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:37:04,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:37:04 BoogieIcfgContainer [2025-03-04 12:37:04,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:37:04,502 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:37:04,502 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:37:04,502 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:37:04,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:59" (3/4) ... [2025-03-04 12:37:04,504 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 12:37:04,508 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 12:37:04,508 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2025-03-04 12:37:04,508 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 12:37:04,509 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2025-03-04 12:37:04,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 12:37:04,515 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 12:37:04,515 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 12:37:04,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:37:04,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:37:04,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 12:37:04,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 12:37:04,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:37:04,586 INFO L158 Benchmark]: Toolchain (without parser) took 6073.77ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 75.1MB in the end (delta: 44.6MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-03-04 12:37:04,586 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:37:04,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 858.18ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 58.4MB in the end (delta: 61.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 12:37:04,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.61ms. Allocated memory is still 167.8MB. Free memory was 58.4MB in the beginning and 55.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:37:04,587 INFO L158 Benchmark]: Boogie Preprocessor took 50.98ms. Allocated memory is still 167.8MB. Free memory was 55.5MB in the beginning and 53.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:37:04,587 INFO L158 Benchmark]: IcfgBuilder took 384.90ms. Allocated memory is still 167.8MB. Free memory was 53.2MB in the beginning and 120.5MB in the end (delta: -67.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2025-03-04 12:37:04,588 INFO L158 Benchmark]: TraceAbstraction took 4630.85ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 81.6MB in the end (delta: 38.9MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-03-04 12:37:04,588 INFO L158 Benchmark]: Witness Printer took 83.53ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 75.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:37:04,589 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.60ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 858.18ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 58.4MB in the end (delta: 61.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.61ms. Allocated memory is still 167.8MB. Free memory was 58.4MB in the beginning and 55.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.98ms. Allocated memory is still 167.8MB. Free memory was 55.5MB in the beginning and 53.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 384.90ms. Allocated memory is still 167.8MB. Free memory was 53.2MB in the beginning and 120.5MB in the end (delta: -67.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4630.85ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 81.6MB in the end (delta: 38.9MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 83.53ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 75.1MB in the end (delta: 6.4MB). 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: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: 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 5 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 2741 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1399 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1342 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1130 NumberOfCodeBlocks, 1130 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1108 ConstructedInterpolants, 0 QuantifiedInterpolants, 1344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1783 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 529/569 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 RESULT: Ultimate proved your program to be correct! [2025-03-04 12:37:04,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE