./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_add_17_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 d4ea41e2590f6d53feb4a10faaed8fdc938d31e5e9690998824676ba87605bf2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 16:49:58,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 16:49:58,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 16:49:58,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 16:49:58,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 16:49:58,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 16:49:58,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 16:49:58,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 16:49:58,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 16:49:58,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 16:49:58,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 16:49:58,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 16:49:58,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 16:49:58,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 16:49:58,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 16:49:58,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 16:49:58,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 16:49:58,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 16:49:58,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 16:49:58,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:49:58,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 16:49:58,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 16:49:58,877 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 -> d4ea41e2590f6d53feb4a10faaed8fdc938d31e5e9690998824676ba87605bf2 [2025-03-17 16:49:59,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 16:49:59,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 16:49:59,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 16:49:59,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 16:49:59,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 16:49:59,109 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_add_17_good.i [2025-03-17 16:50:00,205 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f62e5e4/0794033c94b94c428833f52196cd8811/FLAGc3ca56438 [2025-03-17 16:50:00,511 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 16:50:00,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_17_good.i [2025-03-17 16:50:00,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f62e5e4/0794033c94b94c428833f52196cd8811/FLAGc3ca56438 [2025-03-17 16:50:00,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f62e5e4/0794033c94b94c428833f52196cd8811 [2025-03-17 16:50:00,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 16:50:00,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 16:50:00,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 16:50:00,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 16:50:00,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 16:50:00,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:50:00" (1/1) ... [2025-03-17 16:50:00,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c868e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:00, skipping insertion in model container [2025-03-17 16:50:00,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:50:00" (1/1) ... [2025-03-17 16:50:00,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 16:50:01,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:50:01,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 16:50:01,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:50:01,400 INFO L204 MainTranslator]: Completed translation [2025-03-17 16:50:01,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01 WrapperNode [2025-03-17 16:50:01,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 16:50:01,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 16:50:01,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 16:50:01,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 16:50:01,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,445 INFO L138 Inliner]: procedures = 500, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2025-03-17 16:50:01,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 16:50:01,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 16:50:01,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 16:50:01,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 16:50:01,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,466 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-17 16:50:01,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 16:50:01,476 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 16:50:01,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 16:50:01,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 16:50:01,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (1/1) ... [2025-03-17 16:50:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:50:01,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:50:01,504 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-17 16:50:01,508 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-17 16:50:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 16:50:01,524 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 16:50:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 16:50:01,525 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 16:50:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 16:50:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 16:50:01,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 16:50:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 16:50:01,629 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 16:50:01,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 16:50:01,794 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-17 16:50:01,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 16:50:01,803 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 16:50:01,803 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 16:50:01,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:50:01 BoogieIcfgContainer [2025-03-17 16:50:01,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 16:50:01,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 16:50:01,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 16:50:01,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 16:50:01,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:50:00" (1/3) ... [2025-03-17 16:50:01,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9fe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:50:01, skipping insertion in model container [2025-03-17 16:50:01,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:01" (2/3) ... [2025-03-17 16:50:01,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9fe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:50:01, skipping insertion in model container [2025-03-17 16:50:01,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:50:01" (3/3) ... [2025-03-17 16:50:01,811 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_17_good.i [2025-03-17 16:50:01,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 16:50:01,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_add_17_good.i that has 3 procedures, 52 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-17 16:50:01,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 16:50:01,889 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;@6c1efb55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 16:50:01,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 16:50:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 16:50:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 16:50:01,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:01,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:01,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:01,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1486654299, now seen corresponding path program 1 times [2025-03-17 16:50:01,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:01,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025471655] [2025-03-17 16:50:01,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:01,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:01,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 16:50:02,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 16:50:02,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:02,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:02,171 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-17 16:50:02,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:02,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025471655] [2025-03-17 16:50:02,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025471655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:02,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:02,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:50:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464083333] [2025-03-17 16:50:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:50:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:02,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:50:02,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:02,192 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:02,243 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2025-03-17 16:50:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:50:02,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 16:50:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:02,250 INFO L225 Difference]: With dead ends: 101 [2025-03-17 16:50:02,251 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 16:50:02,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:02,256 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:02,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 167 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 16:50:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 16:50:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 48 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 16:50:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-17 16:50:02,289 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 11 [2025-03-17 16:50:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:02,290 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-17 16:50:02,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-17 16:50:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 16:50:02,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:02,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:02,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 16:50:02,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:02,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1963610749, now seen corresponding path program 1 times [2025-03-17 16:50:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127396787] [2025-03-17 16:50:02,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:02,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 16:50:02,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 16:50:02,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:02,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 16:50:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127396787] [2025-03-17 16:50:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127396787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:50:02,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510583688] [2025-03-17 16:50:02,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:02,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:50:02,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:50:02,426 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-17 16:50:02,427 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-17 16:50:02,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 16:50:02,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 16:50:02,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:02,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:02,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:50:02,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:50:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 16:50:02,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:50:02,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510583688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:02,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:50:02,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:50:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18944621] [2025-03-17 16:50:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:02,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:50:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:02,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:50:02,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:02,580 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:02,609 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2025-03-17 16:50:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:50:02,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 16:50:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:02,611 INFO L225 Difference]: With dead ends: 92 [2025-03-17 16:50:02,611 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 16:50:02,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:02,612 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:02,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 16:50:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 16:50:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.5) internal successors, (45), 41 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 16:50:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-17 16:50:02,616 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2025-03-17 16:50:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:02,616 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-17 16:50:02,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-17 16:50:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 16:50:02,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:02,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:02,623 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-17 16:50:02,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:50:02,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:02,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1963885852, now seen corresponding path program 1 times [2025-03-17 16:50:02,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374690151] [2025-03-17 16:50:02,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:02,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 16:50:02,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 16:50:02,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:02,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 16:50:02,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:02,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374690151] [2025-03-17 16:50:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374690151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:02,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:50:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079512889] [2025-03-17 16:50:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:02,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:50:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:02,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:50:02,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:50:02,887 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:02,903 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-03-17 16:50:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:50:02,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 16:50:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:02,905 INFO L225 Difference]: With dead ends: 47 [2025-03-17 16:50:02,905 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 16:50:02,905 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-17 16:50:02,906 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 11 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:02,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 16:50:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 16:50:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 40 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 16:50:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-03-17 16:50:02,915 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-03-17 16:50:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:02,916 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-17 16:50:02,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-03-17 16:50:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 16:50:02,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:02,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 16:50:02,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1963900714, now seen corresponding path program 1 times [2025-03-17 16:50:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132470361] [2025-03-17 16:50:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:02,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 16:50:02,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 16:50:02,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:02,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 16:50:02,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:02,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132470361] [2025-03-17 16:50:02,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132470361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:02,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:02,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:50:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706862237] [2025-03-17 16:50:02,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:02,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:50:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:02,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:50:02,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:50:02,985 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:03,003 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2025-03-17 16:50:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:50:03,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 16:50:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:03,005 INFO L225 Difference]: With dead ends: 74 [2025-03-17 16:50:03,005 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 16:50:03,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:50:03,006 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 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-17 16:50:03,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 16:50:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-03-17 16:50:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 41 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 16:50:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-17 16:50:03,015 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2025-03-17 16:50:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:03,015 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-17 16:50:03,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-17 16:50:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 16:50:03,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:03,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:03,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 16:50:03,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:03,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash -750919264, now seen corresponding path program 1 times [2025-03-17 16:50:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:03,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728900238] [2025-03-17 16:50:03,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:03,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 16:50:03,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 16:50:03,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 16:50:03,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:03,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728900238] [2025-03-17 16:50:03,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728900238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:03,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:50:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024457623] [2025-03-17 16:50:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:03,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:50:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:03,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:50:03,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:50:03,053 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:03,071 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2025-03-17 16:50:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:50:03,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 16:50:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:03,071 INFO L225 Difference]: With dead ends: 94 [2025-03-17 16:50:03,071 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 16:50:03,072 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-17 16:50:03,072 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:03,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 16:50:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-17 16:50:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 16:50:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-17 16:50:03,082 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2025-03-17 16:50:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:03,082 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-17 16:50:03,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 16:50:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-17 16:50:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 16:50:03,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:03,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:03,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 16:50:03,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:03,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1027847381, now seen corresponding path program 1 times [2025-03-17 16:50:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892920328] [2025-03-17 16:50:03,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:03,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 16:50:03,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 16:50:03,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 16:50:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:03,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892920328] [2025-03-17 16:50:03,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892920328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:50:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007800752] [2025-03-17 16:50:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:03,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:50:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:03,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:50:03,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:03,144 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 16:50:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:03,171 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-03-17 16:50:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:50:03,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-17 16:50:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:03,172 INFO L225 Difference]: With dead ends: 71 [2025-03-17 16:50:03,172 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 16:50:03,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:03,173 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:03,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 140 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 16:50:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 16:50:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 59 states have internal predecessors, (69), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 16:50:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2025-03-17 16:50:03,183 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 22 [2025-03-17 16:50:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:03,183 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-03-17 16:50:03,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 16:50:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2025-03-17 16:50:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 16:50:03,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:03,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:03,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 16:50:03,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:03,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash -670968430, now seen corresponding path program 1 times [2025-03-17 16:50:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031925920] [2025-03-17 16:50:03,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:03,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 16:50:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 16:50:03,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 16:50:03,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:03,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031925920] [2025-03-17 16:50:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031925920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:50:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598537100] [2025-03-17 16:50:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:03,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:50:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:03,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:50:03,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:03,249 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 16:50:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:03,272 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2025-03-17 16:50:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:50:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-17 16:50:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:03,274 INFO L225 Difference]: With dead ends: 88 [2025-03-17 16:50:03,274 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 16:50:03,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:03,275 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:03,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 16:50:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 16:50:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.309090909090909) internal successors, (72), 62 states have internal predecessors, (72), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 16:50:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2025-03-17 16:50:03,282 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 26 [2025-03-17 16:50:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:03,282 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2025-03-17 16:50:03,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 16:50:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2025-03-17 16:50:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 16:50:03,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:03,283 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 16:50:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 16:50:03,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:03,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:03,284 INFO L85 PathProgramCache]: Analyzing trace with hash -42711357, now seen corresponding path program 1 times [2025-03-17 16:50:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:03,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372606945] [2025-03-17 16:50:03,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 16:50:03,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 16:50:03,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 16:50:03,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372606945] [2025-03-17 16:50:03,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372606945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:50:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502042400] [2025-03-17 16:50:03,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:50:03,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:50:03,359 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-17 16:50:03,360 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-17 16:50:03,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 16:50:03,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 16:50:03,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:50:03,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:50:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 16:50:03,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:50:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502042400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:03,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:50:03,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:50:03,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673927156] [2025-03-17 16:50:03,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:03,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:50:03,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:03,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:50:03,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:03,464 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 16:50:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:03,478 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2025-03-17 16:50:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:50:03,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-17 16:50:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:03,480 INFO L225 Difference]: With dead ends: 87 [2025-03-17 16:50:03,480 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 16:50:03,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:03,480 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:03,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 16:50:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 16:50:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 58 states have internal predecessors, (67), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 16:50:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2025-03-17 16:50:03,487 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 29 [2025-03-17 16:50:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:03,488 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2025-03-17 16:50:03,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 16:50:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2025-03-17 16:50:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 16:50:03,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:03,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:03,498 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-17 16:50:03,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 16:50:03,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:03,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1324057009, now seen corresponding path program 1 times [2025-03-17 16:50:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055106503] [2025-03-17 16:50:03,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:03,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 16:50:03,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 16:50:03,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 16:50:03,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:03,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055106503] [2025-03-17 16:50:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055106503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:03,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:50:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583171212] [2025-03-17 16:50:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:50:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:03,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:50:03,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:50:03,730 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 16:50:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:03,747 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2025-03-17 16:50:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:50:03,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-17 16:50:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:03,748 INFO L225 Difference]: With dead ends: 68 [2025-03-17 16:50:03,748 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 16:50:03,748 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-17 16:50:03,748 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 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-17 16:50:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 16:50:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 16:50:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 56 states have internal predecessors, (65), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 16:50:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-03-17 16:50:03,757 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 30 [2025-03-17 16:50:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:03,757 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-03-17 16:50:03,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 16:50:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-03-17 16:50:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 16:50:03,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:03,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:03,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 16:50:03,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:03,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1906887825, now seen corresponding path program 1 times [2025-03-17 16:50:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483687530] [2025-03-17 16:50:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:03,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 16:50:03,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 16:50:03,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 16:50:03,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483687530] [2025-03-17 16:50:03,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483687530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:50:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277237701] [2025-03-17 16:50:03,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:50:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:50:03,809 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-17 16:50:03,811 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-17 16:50:03,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 16:50:03,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 16:50:03,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:03,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:50:03,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:50:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 16:50:03,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:50:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277237701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:50:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:50:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422676363] [2025-03-17 16:50:03,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:03,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:50:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:03,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:50:03,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:03,897 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 16:50:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:03,920 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2025-03-17 16:50:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:50:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-17 16:50:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:03,921 INFO L225 Difference]: With dead ends: 88 [2025-03-17 16:50:03,921 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 16:50:03,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:03,922 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:03,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 16:50:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-17 16:50:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 16:50:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-03-17 16:50:03,926 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 32 [2025-03-17 16:50:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:03,926 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-03-17 16:50:03,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 16:50:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-03-17 16:50:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 16:50:03,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:03,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:03,938 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-17 16:50:04,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:50:04,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:04,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1479574080, now seen corresponding path program 1 times [2025-03-17 16:50:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366171713] [2025-03-17 16:50:04,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:04,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 16:50:04,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 16:50:04,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:04,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 16:50:04,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366171713] [2025-03-17 16:50:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366171713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:04,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:50:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:50:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051839671] [2025-03-17 16:50:04,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:04,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:50:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:04,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:50:04,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:04,184 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-17 16:50:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:04,203 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-03-17 16:50:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:50:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 37 [2025-03-17 16:50:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:04,204 INFO L225 Difference]: With dead ends: 56 [2025-03-17 16:50:04,205 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 16:50:04,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:50:04,206 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:04,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 16:50:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 16:50:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 46 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 16:50:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-17 16:50:04,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 37 [2025-03-17 16:50:04,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:04,213 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-17 16:50:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-17 16:50:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-17 16:50:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 16:50:04,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:50:04,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 16:50:04,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:50:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:50:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 759684294, now seen corresponding path program 1 times [2025-03-17 16:50:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:50:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67813703] [2025-03-17 16:50:04,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:50:04,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 16:50:04,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 16:50:04,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:04,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 16:50:04,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:50:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67813703] [2025-03-17 16:50:04,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67813703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:50:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134622455] [2025-03-17 16:50:04,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:50:04,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:50:04,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:50:04,296 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-17 16:50:04,297 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-17 16:50:04,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 16:50:04,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 16:50:04,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:50:04,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:50:04,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:50:04,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:50:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 16:50:04,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:50:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134622455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:50:04,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:50:04,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:50:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401722646] [2025-03-17 16:50:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:50:04,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:50:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:50:04,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:50:04,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:04,410 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 16:50:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:50:04,426 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-03-17 16:50:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:50:04,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-03-17 16:50:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:50:04,427 INFO L225 Difference]: With dead ends: 58 [2025-03-17 16:50:04,427 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 16:50:04,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:50:04,428 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:50:04,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:50:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 16:50:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 16:50:04,429 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-17 16:50:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 16:50:04,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2025-03-17 16:50:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:50:04,430 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 16:50:04,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 16:50:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 16:50:04,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 16:50:04,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-17 16:50:04,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-17 16:50:04,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-17 16:50:04,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-17 16:50:04,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-17 16:50:04,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-17 16:50:04,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-17 16:50:04,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-17 16:50:04,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-17 16:50:04,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-17 16:50:04,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-17 16:50:04,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-17 16:50:04,440 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-17 16:50:04,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:50:04,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:50:04,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 16:50:04,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 16:50:04,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:50:04 BoogieIcfgContainer [2025-03-17 16:50:04,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 16:50:04,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 16:50:04,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 16:50:04,777 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 16:50:04,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:50:01" (3/4) ... [2025-03-17 16:50:04,779 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 16:50:04,785 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 16:50:04,785 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 16:50:04,790 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 16:50:04,790 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 16:50:04,790 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 16:50:04,790 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 16:50:04,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 16:50:04,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 16:50:04,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 16:50:04,851 INFO L158 Benchmark]: Toolchain (without parser) took 4073.02ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 121.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2025-03-17 16:50:04,851 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:50:04,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.20ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 66.1MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 16:50:04,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.55ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 63.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 16:50:04,851 INFO L158 Benchmark]: Boogie Preprocessor took 29.70ms. Allocated memory is still 167.8MB. Free memory was 63.6MB in the beginning and 61.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:50:04,852 INFO L158 Benchmark]: IcfgBuilder took 327.87ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 46.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 16:50:04,852 INFO L158 Benchmark]: TraceAbstraction took 2971.80ms. Allocated memory is still 167.8MB. Free memory was 45.9MB in the beginning and 126.9MB in the end (delta: -81.0MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2025-03-17 16:50:04,852 INFO L158 Benchmark]: Witness Printer took 72.77ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 121.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 16:50:04,853 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.20ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 66.1MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.55ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 63.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.70ms. Allocated memory is still 167.8MB. Free memory was 63.6MB in the beginning and 61.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.87ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 46.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2971.80ms. Allocated memory is still 167.8MB. Free memory was 45.9MB in the beginning and 126.9MB in the end (delta: -81.0MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. * Witness Printer took 72.77ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 121.6MB in the end (delta: 5.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: 1589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: 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 3 procedures, 52 locations, 68 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 1573 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 988 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 585 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, InterpolantAutomatonStates: 48, 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, 12 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 116/120 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 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: (((1 <= i) && (0 <= (data + 2147483648))) || (((0 <= (data + 2147483648)) && (i == 0)) && (data <= 2147483646))) - InvariantResult [Line: 1585]: Location Invariant Derived location invariant: (((1 <= h) && (data == 2)) || (h == 0)) - InvariantResult [Line: 1567]: Location Invariant Derived location invariant: (((k == 0) && (0 <= (data + 2147483648))) || ((1 <= k) && (0 <= (data + 2147483648)))) - InvariantResult [Line: 1589]: Location Invariant Derived location invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) RESULT: Ultimate proved your program to be correct! [2025-03-17 16:50:04,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE