./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_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_multiply_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 0d9fe6afba387bdc3df869af849969106aba5d49894367553fbb218bd7a49eac --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 16:50:59,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 16:50:59,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 16:50:59,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 16:50:59,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 16:50:59,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 16:50:59,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 16:50:59,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 16:50:59,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 16:50:59,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 16:50:59,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 16:50:59,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 16:50:59,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 16:50:59,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 16:50:59,585 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 16:50:59,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 16:50:59,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:50:59,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 16:50:59,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 16:50:59,587 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 -> 0d9fe6afba387bdc3df869af849969106aba5d49894367553fbb218bd7a49eac [2025-03-17 16:50:59,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 16:50:59,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 16:50:59,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 16:50:59,821 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 16:50:59,821 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 16:50:59,822 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_multiply_17_good.i [2025-03-17 16:51:00,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6069f954/610278e469c745738ffe34d7bf41159e/FLAG12c28a469 [2025-03-17 16:51:01,360 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 16:51:01,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_good.i [2025-03-17 16:51:01,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6069f954/610278e469c745738ffe34d7bf41159e/FLAG12c28a469 [2025-03-17 16:51:01,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6069f954/610278e469c745738ffe34d7bf41159e [2025-03-17 16:51:01,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 16:51:01,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 16:51:01,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 16:51:01,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 16:51:01,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 16:51:01,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:51:01" (1/1) ... [2025-03-17 16:51:01,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:01, skipping insertion in model container [2025-03-17 16:51:01,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:51:01" (1/1) ... [2025-03-17 16:51:01,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 16:51:02,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:51:02,163 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 16:51:02,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:51:02,296 INFO L204 MainTranslator]: Completed translation [2025-03-17 16:51:02,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02 WrapperNode [2025-03-17 16:51:02,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 16:51:02,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 16:51:02,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 16:51:02,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 16:51:02,301 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:51:02" (1/1) ... [2025-03-17 16:51:02,325 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:51:02" (1/1) ... [2025-03-17 16:51:02,339 INFO L138 Inliner]: procedures = 500, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2025-03-17 16:51:02,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 16:51:02,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 16:51:02,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 16:51:02,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 16:51:02,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,361 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:51:02,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 16:51:02,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 16:51:02,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 16:51:02,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 16:51:02,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (1/1) ... [2025-03-17 16:51:02,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:51:02,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:51:02,408 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:51:02,410 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:51:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 16:51:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 16:51:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 16:51:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 16:51:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 16:51:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 16:51:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 16:51:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 16:51:02,510 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 16:51:02,513 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 16:51:02,668 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-17 16:51:02,668 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 16:51:02,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 16:51:02,679 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 16:51:02,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:51:02 BoogieIcfgContainer [2025-03-17 16:51:02,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 16:51:02,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 16:51:02,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 16:51:02,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 16:51:02,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:51:01" (1/3) ... [2025-03-17 16:51:02,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b5f05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:51:02, skipping insertion in model container [2025-03-17 16:51:02,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:02" (2/3) ... [2025-03-17 16:51:02,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b5f05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:51:02, skipping insertion in model container [2025-03-17 16:51:02,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:51:02" (3/3) ... [2025-03-17 16:51:02,688 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_17_good.i [2025-03-17 16:51:02,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 16:51:02,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_multiply_17_good.i that has 3 procedures, 55 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-17 16:51:02,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 16:51:02,761 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;@6f64ccdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 16:51:02,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 16:51:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 48 states have internal predecessors, (55), 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:51:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 16:51:02,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:02,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:02,770 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:51:02,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1578840549, now seen corresponding path program 1 times [2025-03-17 16:51:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:02,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28008119] [2025-03-17 16:51:02,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:02,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 16:51:02,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 16:51:02,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:02,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:03,046 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:51:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28008119] [2025-03-17 16:51:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28008119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:03,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:51:03,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126691608] [2025-03-17 16:51:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:03,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:51:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:03,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:51:03,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:51:03,065 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 48 states have internal predecessors, (55), 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:51:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:03,103 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2025-03-17 16:51:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:51:03,104 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:51:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:03,108 INFO L225 Difference]: With dead ends: 107 [2025-03-17 16:51:03,109 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 16:51:03,111 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:51:03,112 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 184 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:51:03,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 184 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 16:51:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 16:51:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 51 states have internal predecessors, (58), 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:51:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-03-17 16:51:03,140 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 11 [2025-03-17 16:51:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:03,141 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-03-17 16:51:03,141 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:51:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-03-17 16:51:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 16:51:03,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:03,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:03,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 16:51:03,143 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:51:03,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1611335432, now seen corresponding path program 1 times [2025-03-17 16:51:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-17 16:51:03,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:03,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 16:51:03,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 16:51:03,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:03,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:03,285 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:51:03,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:03,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-17 16:51:03,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68481097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:51:03,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905306067] [2025-03-17 16:51:03,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:03,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:51:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:51:03,318 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:51:03,319 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:51:03,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 16:51:03,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 16:51:03,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:03,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:03,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:51:03,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:51:03,459 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:51:03,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:51:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905306067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:03,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:51:03,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:51:03,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337147329] [2025-03-17 16:51:03,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:03,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:51:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:03,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:51:03,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:51:03,462 INFO L87 Difference]: Start difference. First operand 57 states and 70 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:51:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:03,496 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2025-03-17 16:51:03,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:51:03,497 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:51:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:03,497 INFO L225 Difference]: With dead ends: 98 [2025-03-17 16:51:03,497 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 16:51:03,497 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:51:03,498 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 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:51:03,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 16:51:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 16:51:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 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:51:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-17 16:51:03,507 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 16 [2025-03-17 16:51:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:03,507 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-17 16:51:03,508 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:51:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-17 16:51:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 16:51:03,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:03,508 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:51:03,515 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:51:03,709 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:51:03,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:51:03,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1611043481, now seen corresponding path program 1 times [2025-03-17 16:51:03,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:03,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902683918] [2025-03-17 16:51:03,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:03,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 16:51:03,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 16:51:03,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:03,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:03,784 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:51:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902683918] [2025-03-17 16:51:03,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902683918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:03,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:51:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225663327] [2025-03-17 16:51:03,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:03,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:51:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:03,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:51:03,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:51:03,786 INFO L87 Difference]: Start difference. First operand 50 states and 60 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:51:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:03,800 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2025-03-17 16:51:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:51:03,801 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:51:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:03,802 INFO L225 Difference]: With dead ends: 82 [2025-03-17 16:51:03,802 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 16:51:03,802 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:51:03,802 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 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:51:03,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 16:51:03,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2025-03-17 16:51:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5) internal successors, (51), 45 states have internal predecessors, (51), 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:51:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-17 16:51:03,808 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 16 [2025-03-17 16:51:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:03,808 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-17 16:51:03,808 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:51:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-17 16:51:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 16:51:03,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:03,809 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:51:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 16:51:03,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:51:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1596737313, now seen corresponding path program 1 times [2025-03-17 16:51:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741593658] [2025-03-17 16:51:03,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:03,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 16:51:03,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 16:51:03,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:03,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:03,878 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:51:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741593658] [2025-03-17 16:51:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741593658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:51:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641983767] [2025-03-17 16:51:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:51:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:03,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:51:03,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:51:03,882 INFO L87 Difference]: Start difference. First operand 51 states and 61 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:51:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:03,903 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2025-03-17 16:51:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:51:03,903 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:51:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:03,904 INFO L225 Difference]: With dead ends: 97 [2025-03-17 16:51:03,904 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 16:51:03,904 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:51:03,905 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 10 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:51:03,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 16:51:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-03-17 16:51:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 49 states have internal predecessors, (58), 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:51:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-17 16:51:03,909 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 17 [2025-03-17 16:51:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:03,909 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-17 16:51:03,909 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:51:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-17 16:51:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 16:51:03,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:03,910 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:51:03,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 16:51:03,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:51:03,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1596736607, now seen corresponding path program 1 times [2025-03-17 16:51:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:03,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896007954] [2025-03-17 16:51:03,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:03,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 16:51:03,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 16:51:03,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:03,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:03,963 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:51:03,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:03,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896007954] [2025-03-17 16:51:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896007954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:03,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:03,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:51:03,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537947257] [2025-03-17 16:51:03,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:03,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:51:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:03,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:51:03,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:51:03,965 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:51:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:03,992 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2025-03-17 16:51:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:51:03,994 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), 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:51:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:03,995 INFO L225 Difference]: With dead ends: 71 [2025-03-17 16:51:03,995 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 16:51:03,995 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:51:03,995 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 158 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:51:03,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 158 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 16:51:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-17 16:51:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 61 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:51:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2025-03-17 16:51:04,006 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 17 [2025-03-17 16:51:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:04,007 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2025-03-17 16:51:04,007 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), 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:51:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2025-03-17 16:51:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 16:51:04,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:04,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:04,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 16:51:04,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:51:04,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2040750856, now seen corresponding path program 1 times [2025-03-17 16:51:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670826268] [2025-03-17 16:51:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:04,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 16:51:04,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 16:51:04,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:04,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:04,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:51:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670826268] [2025-03-17 16:51:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670826268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:04,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:04,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:51:04,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579373729] [2025-03-17 16:51:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:51:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:04,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:51:04,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:51:04,054 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:51:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:04,076 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2025-03-17 16:51:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:51:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2025-03-17 16:51:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:04,077 INFO L225 Difference]: With dead ends: 128 [2025-03-17 16:51:04,078 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 16:51:04,078 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:51:04,078 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:51:04,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 105 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 16:51:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-03-17 16:51:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 73 states have internal predecessors, (90), 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:51:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2025-03-17 16:51:04,087 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 18 [2025-03-17 16:51:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:04,087 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2025-03-17 16:51:04,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:51:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2025-03-17 16:51:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 16:51:04,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:04,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:04,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 16:51:04,088 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:51:04,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1398472478, now seen corresponding path program 1 times [2025-03-17 16:51:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839567596] [2025-03-17 16:51:04,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:04,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 16:51:04,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 16:51:04,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:04,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 16:51:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839567596] [2025-03-17 16:51:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839567596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:04,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:51:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328648229] [2025-03-17 16:51:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:04,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:51:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:04,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:51:04,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:51:04,138 INFO L87 Difference]: Start difference. First operand 83 states and 104 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, (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:51:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:04,158 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2025-03-17 16:51:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:51:04,158 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, (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 21 [2025-03-17 16:51:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:04,159 INFO L225 Difference]: With dead ends: 104 [2025-03-17 16:51:04,160 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 16:51:04,161 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:51:04,161 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 160 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:51:04,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 160 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 16:51:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 16:51:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 76 states have internal predecessors, (93), 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:51:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2025-03-17 16:51:04,174 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 21 [2025-03-17 16:51:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:04,175 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2025-03-17 16:51:04,175 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, (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:51:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2025-03-17 16:51:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 16:51:04,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:04,178 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:51:04,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 16:51:04,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:51:04,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash 403496892, now seen corresponding path program 1 times [2025-03-17 16:51:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-03-17 16:51:04,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 16:51:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 16:51:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 16:51:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-03-17 16:51:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064561013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:51:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592109873] [2025-03-17 16:51:04,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:04,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:51:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:51:04,257 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:51:04,259 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:51:04,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 16:51:04,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 16:51:04,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:04,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:04,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:51:04,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:51:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 16:51:04,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:51:04,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592109873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:04,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:51:04,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:51:04,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774967144] [2025-03-17 16:51:04,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:04,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:51:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:04,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:51:04,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:51:04,359 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:51:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:04,377 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2025-03-17 16:51:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:51:04,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2025-03-17 16:51:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:04,379 INFO L225 Difference]: With dead ends: 117 [2025-03-17 16:51:04,379 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 16:51:04,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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:51:04,380 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:51:04,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 148 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 16:51:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-03-17 16:51:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 50 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:51:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-03-17 16:51:04,387 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 22 [2025-03-17 16:51:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:04,387 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-03-17 16:51:04,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:51:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-03-17 16:51:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 16:51:04,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:04,388 INFO L218 NwaCegarLoop]: trace histogram [2, 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:51:04,394 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:51:04,588 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:51:04,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:51:04,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash 710815066, now seen corresponding path program 1 times [2025-03-17 16:51:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:04,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985456209] [2025-03-17 16:51:04,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:04,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 16:51:04,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 16:51:04,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:04,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 16:51:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985456209] [2025-03-17 16:51:04,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985456209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:51:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577923080] [2025-03-17 16:51:04,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:04,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:51:04,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:51:04,667 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:51:04,669 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:51:04,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 16:51:04,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 16:51:04,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:04,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:04,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:51:04,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:51:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 16:51:04,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:51:04,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577923080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:04,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:51:04,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:51:04,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138311912] [2025-03-17 16:51:04,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:04,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:51:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:04,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:51:04,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:51:04,765 INFO L87 Difference]: Start difference. First operand 57 states and 67 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, (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:51:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:04,778 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-03-17 16:51:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:51:04,779 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, (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 24 [2025-03-17 16:51:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:04,780 INFO L225 Difference]: With dead ends: 74 [2025-03-17 16:51:04,780 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 16:51:04,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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:51:04,781 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 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:51:04,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 16:51:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-17 16:51:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 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:51:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-03-17 16:51:04,785 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 24 [2025-03-17 16:51:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:04,785 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-03-17 16:51:04,785 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, (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:51:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-03-17 16:51:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 16:51:04,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:04,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:04,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 16:51:04,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:51:04,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 16:51:04,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 193325241, now seen corresponding path program 1 times [2025-03-17 16:51:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338417589] [2025-03-17 16:51:04,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:04,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 16:51:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 16:51:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:04,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 16:51:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338417589] [2025-03-17 16:51:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338417589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:05,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:51:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656722051] [2025-03-17 16:51:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:05,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:51:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:05,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:51:05,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:51:05,025 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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:51:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:05,036 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2025-03-17 16:51:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:51:05,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 26 [2025-03-17 16:51:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:05,037 INFO L225 Difference]: With dead ends: 67 [2025-03-17 16:51:05,037 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 16:51:05,038 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:51:05,038 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:51:05,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 16:51:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 16:51:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 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:51:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-17 16:51:05,043 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 26 [2025-03-17 16:51:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:05,044 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-17 16:51:05,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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:51:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-17 16:51:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 16:51:05,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:05,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:05,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 16:51:05,045 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:51:05,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash -700434027, now seen corresponding path program 1 times [2025-03-17 16:51:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895023299] [2025-03-17 16:51:05,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:05,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 16:51:05,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 16:51:05,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:05,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 16:51:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895023299] [2025-03-17 16:51:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895023299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:05,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:51:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:51:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649613855] [2025-03-17 16:51:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:05,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 16:51:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:05,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 16:51:05,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 16:51:05,103 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:51:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:05,122 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2025-03-17 16:51:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 16:51:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 34 [2025-03-17 16:51:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:05,123 INFO L225 Difference]: With dead ends: 62 [2025-03-17 16:51:05,124 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 16:51:05,124 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:51:05,125 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 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:51:05,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 16:51:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 16:51:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 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:51:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2025-03-17 16:51:05,130 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 34 [2025-03-17 16:51:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:05,130 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2025-03-17 16:51:05,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:51:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2025-03-17 16:51:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 16:51:05,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:51:05,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:05,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 16:51:05,131 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:51:05,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:51:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1546136100, now seen corresponding path program 1 times [2025-03-17 16:51:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:51:05,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868772553] [2025-03-17 16:51:05,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:51:05,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 16:51:05,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 16:51:05,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:05,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 16:51:05,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:51:05,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868772553] [2025-03-17 16:51:05,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868772553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 16:51:05,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749237852] [2025-03-17 16:51:05,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:51:05,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:51:05,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:51:05,211 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:51:05,213 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:51:05,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 16:51:05,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 16:51:05,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:51:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:51:05,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 16:51:05,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:51:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 16:51:05,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:51:05,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749237852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:51:05,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 16:51:05,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 16:51:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872121607] [2025-03-17 16:51:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:51:05,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 16:51:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:51:05,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 16:51:05,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 16:51:05,324 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:51:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:51:05,338 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-03-17 16:51:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 16:51:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 46 [2025-03-17 16:51:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:51:05,339 INFO L225 Difference]: With dead ends: 64 [2025-03-17 16:51:05,339 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 16:51:05,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 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:51:05,340 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 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:51:05,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:51:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 16:51:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 16:51:05,341 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:51:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 16:51:05,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2025-03-17 16:51:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:51:05,341 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 16:51:05,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:51:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 16:51:05,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 16:51:05,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-17 16:51:05,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-17 16:51:05,351 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:51:05,545 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:51:05,548 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:51:05,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 16:51:05,606 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 16:51:05,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:51:05 BoogieIcfgContainer [2025-03-17 16:51:05,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 16:51:05,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 16:51:05,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 16:51:05,621 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 16:51:05,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:51:02" (3/4) ... [2025-03-17 16:51:05,623 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 16:51:05,626 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 16:51:05,626 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 16:51:05,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 16:51:05,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 16:51:05,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 16:51:05,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 16:51:05,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 16:51:05,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 16:51:05,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 16:51:05,709 INFO L158 Benchmark]: Toolchain (without parser) took 4168.31ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 124.3MB in the end (delta: -5.0MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2025-03-17 16:51:05,709 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:51:05,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.06ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 58.8MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 16:51:05,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.14ms. Allocated memory is still 167.8MB. Free memory was 58.8MB in the beginning and 56.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 16:51:05,711 INFO L158 Benchmark]: Boogie Preprocessor took 27.62ms. Allocated memory is still 167.8MB. Free memory was 56.1MB in the beginning and 54.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:51:05,711 INFO L158 Benchmark]: IcfgBuilder took 312.38ms. Allocated memory is still 167.8MB. Free memory was 54.2MB in the beginning and 38.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 16:51:05,711 INFO L158 Benchmark]: TraceAbstraction took 2938.70ms. Allocated memory is still 167.8MB. Free memory was 37.9MB in the beginning and 46.3MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:51:05,711 INFO L158 Benchmark]: Witness Printer took 87.36ms. Allocated memory is still 167.8MB. Free memory was 46.3MB in the beginning and 124.3MB in the end (delta: -78.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2025-03-17 16:51:05,712 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.29ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.06ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 58.8MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.14ms. Allocated memory is still 167.8MB. Free memory was 58.8MB in the beginning and 56.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.62ms. Allocated memory is still 167.8MB. Free memory was 56.1MB in the beginning and 54.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.38ms. Allocated memory is still 167.8MB. Free memory was 54.2MB in the beginning and 38.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2938.70ms. Allocated memory is still 167.8MB. Free memory was 37.9MB in the beginning and 46.3MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.36ms. Allocated memory is still 167.8MB. Free memory was 46.3MB in the beginning and 124.3MB in the end (delta: -78.1MB). Peak memory consumption was 15.2MB. 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: 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: 1596]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1596]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: 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: 1573]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1573]: 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, 55 locations, 73 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 1721 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1070 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 651 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 62/66 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: (((i == 0) && (data <= 1073741822)) || (0 < i)) - InvariantResult [Line: 1588]: Location Invariant Derived location invariant: (((1 <= h) && (data == 2)) || (h == 0)) - InvariantResult [Line: 1592]: Location Invariant Derived location invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) - InvariantResult [Line: 1567]: Location Invariant Derived location invariant: ((k == 0) || (1 <= k)) RESULT: Ultimate proved your program to be correct! [2025-03-17 16:51:05,726 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