./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_06_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_06_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 df89a14057ba9286c3185aa82d3abfb5eeec251fcc60239dd65121aa19dd4cae --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 04:43:13,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 04:43:13,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 04:43:13,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 04:43:13,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 04:43:13,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 04:43:13,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 04:43:13,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 04:43:13,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 04:43:13,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 04:43:13,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 04:43:13,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 04:43:13,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 04:43:13,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 04:43:13,678 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 04:43:13,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 04:43:13,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 04:43:13,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 04:43:13,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:43:13,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:43:13,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:43:13,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 04:43:13,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 04:43:13,683 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-jdk21/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 -> df89a14057ba9286c3185aa82d3abfb5eeec251fcc60239dd65121aa19dd4cae [2025-01-10 04:43:14,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 04:43:14,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 04:43:14,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 04:43:14,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 04:43:14,122 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 04:43:14,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_06_good.i [2025-01-10 04:43:15,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cbbc7176/b52f0dc9ff604bd594ca9070ec63dc14/FLAG0bcf4aae6 [2025-01-10 04:43:15,966 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 04:43:15,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_06_good.i [2025-01-10 04:43:15,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cbbc7176/b52f0dc9ff604bd594ca9070ec63dc14/FLAG0bcf4aae6 [2025-01-10 04:43:16,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cbbc7176/b52f0dc9ff604bd594ca9070ec63dc14 [2025-01-10 04:43:16,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 04:43:16,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 04:43:16,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 04:43:16,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 04:43:16,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 04:43:16,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:43:16" (1/1) ... [2025-01-10 04:43:16,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2e1568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:16, skipping insertion in model container [2025-01-10 04:43:16,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:43:16" (1/1) ... [2025-01-10 04:43:16,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 04:43:16,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:43:16,799 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 04:43:16,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:43:17,028 INFO L204 MainTranslator]: Completed translation [2025-01-10 04:43:17,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17 WrapperNode [2025-01-10 04:43:17,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 04:43:17,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 04:43:17,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 04:43:17,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 04:43:17,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,080 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 206 [2025-01-10 04:43:17,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 04:43:17,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 04:43:17,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 04:43:17,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 04:43:17,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,100 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 04:43:17,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 04:43:17,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 04:43:17,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 04:43:17,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 04:43:17,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (1/1) ... [2025-01-10 04:43:17,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:43:17,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:43:17,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 04:43:17,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 04:43:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 04:43:17,185 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 04:43:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 04:43:17,185 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 04:43:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 04:43:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 04:43:17,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 04:43:17,339 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 04:43:17,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 04:43:17,681 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-01-10 04:43:17,682 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 04:43:17,694 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 04:43:17,695 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 04:43:17,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:43:17 BoogieIcfgContainer [2025-01-10 04:43:17,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 04:43:17,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 04:43:17,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 04:43:17,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 04:43:17,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:43:16" (1/3) ... [2025-01-10 04:43:17,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af133ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:43:17, skipping insertion in model container [2025-01-10 04:43:17,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:17" (2/3) ... [2025-01-10 04:43:17,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af133ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:43:17, skipping insertion in model container [2025-01-10 04:43:17,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:43:17" (3/3) ... [2025-01-10 04:43:17,704 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_06_good.i [2025-01-10 04:43:17,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 04:43:17,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_postinc_06_good.i that has 3 procedures, 103 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 04:43:17,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 04:43:17,776 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;@c213f3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 04:43:17,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 04:43:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 04:43:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 04:43:17,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:17,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:17,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:17,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1257461886, now seen corresponding path program 1 times [2025-01-10 04:43:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:17,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014468488] [2025-01-10 04:43:17,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:17,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 04:43:17,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 04:43:17,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:17,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:43:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014468488] [2025-01-10 04:43:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014468488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:17,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:17,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:43:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043037751] [2025-01-10 04:43:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:17,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:43:17,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:17,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:43:17,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:43:17,997 INFO L87 Difference]: Start difference. First operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-01-10 04:43:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:18,044 INFO L93 Difference]: Finished difference Result 177 states and 248 transitions. [2025-01-10 04:43:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:43:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-01-10 04:43:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:18,054 INFO L225 Difference]: With dead ends: 177 [2025-01-10 04:43:18,054 INFO L226 Difference]: Without dead ends: 92 [2025-01-10 04:43:18,057 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-01-10 04:43:18,059 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:18,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-10 04:43:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-10 04:43:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 85 states have internal predecessors, (112), 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-01-10 04:43:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2025-01-10 04:43:18,097 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 12 [2025-01-10 04:43:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:18,098 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2025-01-10 04:43:18,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-01-10 04:43:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2025-01-10 04:43:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 04:43:18,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:18,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:18,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 04:43:18,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:18,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash -804808767, now seen corresponding path program 1 times [2025-01-10 04:43:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827729771] [2025-01-10 04:43:18,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:18,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 04:43:18,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 04:43:18,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:18,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:43:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:18,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827729771] [2025-01-10 04:43:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827729771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:18,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:18,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 04:43:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715001669] [2025-01-10 04:43:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:18,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 04:43:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:18,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 04:43:18,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:43:18,384 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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-01-10 04:43:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:18,499 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2025-01-10 04:43:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 04:43:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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-01-10 04:43:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:18,501 INFO L225 Difference]: With dead ends: 99 [2025-01-10 04:43:18,501 INFO L226 Difference]: Without dead ends: 98 [2025-01-10 04:43:18,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 04:43:18,504 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:18,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 624 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 04:43:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-10 04:43:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-01-10 04:43:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 90 states have internal predecessors, (118), 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-01-10 04:43:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2025-01-10 04:43:18,511 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 18 [2025-01-10 04:43:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:18,511 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2025-01-10 04:43:18,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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-01-10 04:43:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2025-01-10 04:43:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 04:43:18,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:18,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:18,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 04:43:18,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1522084711, now seen corresponding path program 1 times [2025-01-10 04:43:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146977548] [2025-01-10 04:43:18,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:18,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:18,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 04:43:18,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 04:43:18,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:18,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:43:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146977548] [2025-01-10 04:43:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146977548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:18,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:18,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:43:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548490898] [2025-01-10 04:43:18,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:18,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:43:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:18,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:43:18,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:43:18,677 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-01-10 04:43:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:18,705 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2025-01-10 04:43:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:43:18,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-01-10 04:43:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:18,708 INFO L225 Difference]: With dead ends: 97 [2025-01-10 04:43:18,708 INFO L226 Difference]: Without dead ends: 96 [2025-01-10 04:43:18,708 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-01-10 04:43:18,709 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 36 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 313 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-01-10 04:43:18,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 313 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-10 04:43:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2025-01-10 04:43:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 84 states have internal predecessors, (111), 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-01-10 04:43:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-01-10 04:43:18,722 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 18 [2025-01-10 04:43:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:18,722 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-01-10 04:43:18,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-01-10 04:43:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-01-10 04:43:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 04:43:18,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:18,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:18,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 04:43:18,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:18,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash 820732141, now seen corresponding path program 1 times [2025-01-10 04:43:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:18,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442475564] [2025-01-10 04:43:18,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:18,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 04:43:18,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 04:43:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:43:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442475564] [2025-01-10 04:43:18,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442475564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:18,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:43:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746429923] [2025-01-10 04:43:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:18,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:43:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:18,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:43:18,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:43:18,791 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 04:43:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:18,802 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2025-01-10 04:43:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:43:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2025-01-10 04:43:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:18,804 INFO L225 Difference]: With dead ends: 91 [2025-01-10 04:43:18,805 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 04:43:18,805 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-01-10 04:43:18,805 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:18,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 04:43:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 04:43:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 83 states have internal predecessors, (110), 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-01-10 04:43:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2025-01-10 04:43:18,813 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 19 [2025-01-10 04:43:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:18,814 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2025-01-10 04:43:18,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 04:43:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2025-01-10 04:43:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 04:43:18,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:18,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:18,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 04:43:18,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:18,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2114690354, now seen corresponding path program 1 times [2025-01-10 04:43:18,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:18,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040637354] [2025-01-10 04:43:18,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:18,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 04:43:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 04:43:18,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 04:43:18,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:18,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040637354] [2025-01-10 04:43:18,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040637354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:18,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:18,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:43:18,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067231453] [2025-01-10 04:43:18,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:18,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:43:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:18,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:43:18,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:43:18,976 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:43:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:18,996 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-01-10 04:43:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:43:18,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-01-10 04:43:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:18,997 INFO L225 Difference]: With dead ends: 90 [2025-01-10 04:43:18,999 INFO L226 Difference]: Without dead ends: 89 [2025-01-10 04:43:18,999 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-01-10 04:43:19,000 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 36 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 307 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-01-10 04:43:19,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 307 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-10 04:43:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-10 04:43:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 82 states have internal predecessors, (109), 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-01-10 04:43:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-01-10 04:43:19,007 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 33 [2025-01-10 04:43:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:19,007 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-01-10 04:43:19,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:43:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-01-10 04:43:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 04:43:19,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:19,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:19,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 04:43:19,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:19,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1130891778, now seen corresponding path program 1 times [2025-01-10 04:43:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:19,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506853163] [2025-01-10 04:43:19,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:19,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 04:43:19,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 04:43:19,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:19,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 04:43:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506853163] [2025-01-10 04:43:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506853163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:19,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:19,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:43:19,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415192852] [2025-01-10 04:43:19,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:19,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:43:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:19,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:43:19,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:43:19,086 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:43:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:19,093 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2025-01-10 04:43:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:43:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-01-10 04:43:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:19,094 INFO L225 Difference]: With dead ends: 89 [2025-01-10 04:43:19,094 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 04:43:19,094 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-01-10 04:43:19,094 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:19,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 04:43:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-10 04:43:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 81 states have internal predecessors, (108), 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-01-10 04:43:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2025-01-10 04:43:19,099 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 34 [2025-01-10 04:43:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:19,099 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2025-01-10 04:43:19,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:43:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2025-01-10 04:43:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 04:43:19,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:19,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 04:43:19,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 04:43:19,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:19,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:19,103 INFO L85 PathProgramCache]: Analyzing trace with hash 403832941, now seen corresponding path program 1 times [2025-01-10 04:43:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:19,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734405497] [2025-01-10 04:43:19,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:19,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 04:43:19,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 04:43:19,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:19,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 04:43:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:19,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734405497] [2025-01-10 04:43:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734405497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:43:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821744190] [2025-01-10 04:43:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:43:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:19,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:43:19,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:43:19,173 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 04:43:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:19,189 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2025-01-10 04:43:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:43:19,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-01-10 04:43:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:19,190 INFO L225 Difference]: With dead ends: 88 [2025-01-10 04:43:19,190 INFO L226 Difference]: Without dead ends: 86 [2025-01-10 04:43:19,190 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-01-10 04:43:19,191 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:19,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-10 04:43:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-10 04:43:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.394736842105263) internal successors, (106), 79 states have internal predecessors, (106), 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-01-10 04:43:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-01-10 04:43:19,199 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 41 [2025-01-10 04:43:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:19,199 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-01-10 04:43:19,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 04:43:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-01-10 04:43:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 04:43:19,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:19,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 04:43:19,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 04:43:19,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:43:19,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash -517882348, now seen corresponding path program 1 times [2025-01-10 04:43:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299206381] [2025-01-10 04:43:19,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:19,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 04:43:19,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 04:43:19,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:19,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 04:43:19,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:19,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299206381] [2025-01-10 04:43:19,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299206381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:19,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:43:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225766057] [2025-01-10 04:43:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:19,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:43:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:19,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:43:19,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:43:19,298 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 04:43:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:19,315 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2025-01-10 04:43:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:43:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-01-10 04:43:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:19,316 INFO L225 Difference]: With dead ends: 86 [2025-01-10 04:43:19,316 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 04:43:19,317 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-01-10 04:43:19,317 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:19,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 339 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 04:43:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 04:43:19,318 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-01-10 04:43:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 04:43:19,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-01-10 04:43:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:19,318 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 04:43:19,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 04:43:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 04:43:19,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 04:43:19,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 04:43:19,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 04:43:19,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 04:43:19,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 04:43:19,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 04:43:19,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 04:43:19,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 04:43:19,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 04:43:19,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 04:43:19,357 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:19,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 04:43:19,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 04:43:19,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:43:19 BoogieIcfgContainer [2025-01-10 04:43:19,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 04:43:19,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 04:43:19,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 04:43:19,413 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 04:43:19,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:43:17" (3/4) ... [2025-01-10 04:43:19,415 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 04:43:19,422 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 04:43:19,425 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 04:43:19,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 04:43:19,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 04:43:19,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 04:43:19,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 04:43:19,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 04:43:19,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 04:43:19,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 04:43:19,524 INFO L158 Benchmark]: Toolchain (without parser) took 3381.00ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.2MB in the end (delta: 12.2MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2025-01-10 04:43:19,524 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:43:19,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 883.94ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 50.2MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 04:43:19,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.26ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 47.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:43:19,525 INFO L158 Benchmark]: Boogie Preprocessor took 33.10ms. Allocated memory is still 142.6MB. Free memory was 47.1MB in the beginning and 45.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:43:19,525 INFO L158 Benchmark]: RCFGBuilder took 581.36ms. Allocated memory is still 142.6MB. Free memory was 45.2MB in the beginning and 91.6MB in the end (delta: -46.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-01-10 04:43:19,525 INFO L158 Benchmark]: TraceAbstraction took 1711.26ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 105.5MB in the end (delta: -14.7MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2025-01-10 04:43:19,525 INFO L158 Benchmark]: Witness Printer took 114.33ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 98.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:43:19,527 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 883.94ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 50.2MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.26ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 47.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.10ms. Allocated memory is still 142.6MB. Free memory was 47.1MB in the beginning and 45.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 581.36ms. Allocated memory is still 142.6MB. Free memory was 45.2MB in the beginning and 91.6MB in the end (delta: -46.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1711.26ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 105.5MB in the end (delta: -14.7MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * Witness Printer took 114.33ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 98.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: 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, 103 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 2520 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1581 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 939 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, InterpolantAutomatonStates: 32, 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, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 32/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 04:43:19,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE