./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_16_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_16_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 ddedac147128eabab0d56f03552123e011eb11e9429e88f95e54212cabd8ba55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 04:43:26,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 04:43:26,203 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:26,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 04:43:26,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 04:43:26,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 04:43:26,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 04:43:26,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 04:43:26,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 04:43:26,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 04:43:26,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 04:43:26,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 04:43:26,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 04:43:26,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 04:43:26,238 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 04:43:26,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 04:43:26,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 04:43:26,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 04:43:26,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:43:26,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:43:26,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:43:26,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:43:26,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 04:43:26,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:43:26,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:43:26,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 04:43:26,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 04:43:26,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 04:43:26,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 04:43:26,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 04:43:26,242 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 -> ddedac147128eabab0d56f03552123e011eb11e9429e88f95e54212cabd8ba55 [2025-01-10 04:43:26,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 04:43:26,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 04:43:26,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 04:43:26,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 04:43:26,496 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 04:43:26,496 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_16_good.i [2025-01-10 04:43:27,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5f17072b/7fa82aaf49444be89847a1223e96e13d/FLAG4af5ae331 [2025-01-10 04:43:28,367 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 04:43:28,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_16_good.i [2025-01-10 04:43:28,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5f17072b/7fa82aaf49444be89847a1223e96e13d/FLAG4af5ae331 [2025-01-10 04:43:28,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5f17072b/7fa82aaf49444be89847a1223e96e13d [2025-01-10 04:43:28,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 04:43:28,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 04:43:28,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 04:43:28,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 04:43:28,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 04:43:28,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:43:28" (1/1) ... [2025-01-10 04:43:28,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f1e355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:28, skipping insertion in model container [2025-01-10 04:43:28,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:43:28" (1/1) ... [2025-01-10 04:43:28,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 04:43:29,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:43:29,183 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 04:43:29,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:43:29,364 INFO L204 MainTranslator]: Completed translation [2025-01-10 04:43:29,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:29 WrapperNode [2025-01-10 04:43:29,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 04:43:29,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 04:43:29,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 04:43:29,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 04:43:29,373 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:29" (1/1) ... [2025-01-10 04:43:29,387 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:29" (1/1) ... [2025-01-10 04:43:29,405 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2025-01-10 04:43:29,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 04:43:29,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 04:43:29,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 04:43:29,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 04:43:29,413 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:29" (1/1) ... [2025-01-10 04:43:29,414 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:29" (1/1) ... [2025-01-10 04:43:29,415 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:29" (1/1) ... [2025-01-10 04:43:29,421 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 04:43:29,422 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:29" (1/1) ... [2025-01-10 04:43:29,422 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:29" (1/1) ... [2025-01-10 04:43:29,425 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:29" (1/1) ... [2025-01-10 04:43:29,425 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:29" (1/1) ... [2025-01-10 04:43:29,428 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:29" (1/1) ... [2025-01-10 04:43:29,429 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:29" (1/1) ... [2025-01-10 04:43:29,429 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:29" (1/1) ... [2025-01-10 04:43:29,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 04:43:29,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 04:43:29,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 04:43:29,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 04:43:29,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:29" (1/1) ... [2025-01-10 04:43:29,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:43:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:43:29,458 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:29,461 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:29,480 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 04:43:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 04:43:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 04:43:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 04:43:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 04:43:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 04:43:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 04:43:29,603 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 04:43:29,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 04:43:29,778 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-01-10 04:43:29,779 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 04:43:29,789 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 04:43:29,789 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 04:43:29,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:43:29 BoogieIcfgContainer [2025-01-10 04:43:29,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 04:43:29,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 04:43:29,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 04:43:29,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 04:43:29,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:43:28" (1/3) ... [2025-01-10 04:43:29,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f6d63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:43:29, skipping insertion in model container [2025-01-10 04:43:29,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:43:29" (2/3) ... [2025-01-10 04:43:29,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f6d63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:43:29, skipping insertion in model container [2025-01-10 04:43:29,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:43:29" (3/3) ... [2025-01-10 04:43:29,804 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_16_good.i [2025-01-10 04:43:29,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 04:43:29,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_postinc_16_good.i that has 3 procedures, 58 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2025-01-10 04:43:29,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 04:43:29,897 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;@22fe0575, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 04:43:29,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 04:43:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.5) internal successors, (69), 51 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 04:43:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 04:43:29,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:29,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:29,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 04:43:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 573554326, now seen corresponding path program 1 times [2025-01-10 04:43:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122893657] [2025-01-10 04:43:29,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:30,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 04:43:30,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 04:43:30,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:30,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:30,118 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:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122893657] [2025-01-10 04:43:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122893657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:30,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:30,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:43:30,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750934552] [2025-01-10 04:43:30,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:30,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 04:43:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:30,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 04:43:30,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 04:43:30,151 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.5) internal successors, (69), 51 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:30,173 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2025-01-10 04:43:30,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 04:43:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-10 04:43:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:30,180 INFO L225 Difference]: With dead ends: 89 [2025-01-10 04:43:30,180 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 04:43:30,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 04:43:30,184 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:30,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:43:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 04:43:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 04:43:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.45) internal successors, (58), 44 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:43:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2025-01-10 04:43:30,217 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2025-01-10 04:43:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:30,218 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2025-01-10 04:43:30,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2025-01-10 04:43:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 04:43:30,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:30,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:30,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 04:43:30,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 04:43:30,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1249943405, now seen corresponding path program 1 times [2025-01-10 04:43:30,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:30,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110742095] [2025-01-10 04:43:30,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:30,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 04:43:30,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 04:43:30,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:30,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:30,584 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:30,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:30,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110742095] [2025-01-10 04:43:30,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110742095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:30,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:30,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 04:43:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093360380] [2025-01-10 04:43:30,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:30,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 04:43:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:30,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 04:43:30,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:43:30,589 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:30,712 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2025-01-10 04:43:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 04:43:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 04:43:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:30,713 INFO L225 Difference]: With dead ends: 55 [2025-01-10 04:43:30,713 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 04:43:30,713 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:30,714 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 40 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 264 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:30,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 264 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:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 04:43:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-01-10 04:43:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 48 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:43:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-01-10 04:43:30,718 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 17 [2025-01-10 04:43:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:30,719 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-01-10 04:43:30,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-01-10 04:43:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 04:43:30,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:30,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:43:30,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 04:43:30,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 04:43:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1041874989, now seen corresponding path program 1 times [2025-01-10 04:43:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372874135] [2025-01-10 04:43:30,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:30,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 04:43:30,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 04:43:30,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:30,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:30,838 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:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372874135] [2025-01-10 04:43:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372874135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:30,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:30,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:43:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072436894] [2025-01-10 04:43:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:30,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:43:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:30,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:43:30,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:43:30,840 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:30,859 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-01-10 04:43:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:43:30,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 04:43:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:30,860 INFO L225 Difference]: With dead ends: 53 [2025-01-10 04:43:30,860 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 04:43:30,860 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:30,861 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 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:30,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 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:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 04:43:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2025-01-10 04:43:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.425) internal successors, (57), 43 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:43:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2025-01-10 04:43:30,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 17 [2025-01-10 04:43:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:30,865 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2025-01-10 04:43:30,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2025-01-10 04:43:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 04:43:30,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:30,866 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:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 04:43:30,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 04:43:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash -93539752, now seen corresponding path program 1 times [2025-01-10 04:43:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754434044] [2025-01-10 04:43:30,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:30,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 04:43:30,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 04:43:30,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:30,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:30,920 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:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754434044] [2025-01-10 04:43:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754434044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:30,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:30,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:43:30,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116713594] [2025-01-10 04:43:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:30,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:43:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:30,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:43:30,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:43:30,924 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:30,936 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2025-01-10 04:43:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:43:30,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 04:43:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:30,937 INFO L225 Difference]: With dead ends: 48 [2025-01-10 04:43:30,937 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 04:43:30,937 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:30,937 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 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:30,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 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:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 04:43:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 04:43:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.4) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:43:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2025-01-10 04:43:30,941 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2025-01-10 04:43:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:30,941 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2025-01-10 04:43:30,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:43:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2025-01-10 04:43:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 04:43:30,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:43:30,942 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] [2025-01-10 04:43:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 04:43:30,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 04:43:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:43:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -117919119, now seen corresponding path program 1 times [2025-01-10 04:43:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:43:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864680996] [2025-01-10 04:43:30,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:43:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:43:30,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 04:43:30,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 04:43:30,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:43:30,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:43:31,001 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:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:43:31,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864680996] [2025-01-10 04:43:31,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864680996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:43:31,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:43:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:43:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558231936] [2025-01-10 04:43:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:43:31,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:43:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:43:31,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:43:31,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:43:31,004 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:43:31,015 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2025-01-10 04:43:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:43:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2025-01-10 04:43:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:43:31,016 INFO L225 Difference]: With dead ends: 47 [2025-01-10 04:43:31,016 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 04:43:31,017 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:31,018 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:43:31,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 171 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:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 04:43:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 04:43:31,019 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:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 04:43:31,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-01-10 04:43:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:43:31,021 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 04:43:31,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 04:43:31,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 04:43:31,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 04:43:31,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 04:43:31,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 04:43:31,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 04:43:31,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 04:43:31,027 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 04:43:31,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 04:43:31,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 04:43:31,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:43:31 BoogieIcfgContainer [2025-01-10 04:43:31,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 04:43:31,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 04:43:31,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 04:43:31,066 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 04:43:31,067 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:29" (3/4) ... [2025-01-10 04:43:31,070 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 04:43:31,075 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 04:43:31,077 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 04:43:31,082 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 04:43:31,084 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 04:43:31,084 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 04:43:31,155 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 04:43:31,155 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 04:43:31,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 04:43:31,156 INFO L158 Benchmark]: Toolchain (without parser) took 2659.70ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 64.2MB in the end (delta: 44.8MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-01-10 04:43:31,158 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:43:31,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 868.73ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 49.9MB in the end (delta: 58.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 04:43:31,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.75ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 47.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:43:31,158 INFO L158 Benchmark]: Boogie Preprocessor took 23.73ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 45.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:43:31,158 INFO L158 Benchmark]: RCFGBuilder took 358.00ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 98.0MB in the end (delta: -52.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-01-10 04:43:31,159 INFO L158 Benchmark]: TraceAbstraction took 1271.75ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 71.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2025-01-10 04:43:31,159 INFO L158 Benchmark]: Witness Printer took 89.18ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 64.2MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:43:31,160 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 868.73ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 49.9MB in the end (delta: 58.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.75ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 47.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.73ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 45.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.00ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 98.0MB in the end (delta: -52.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1271.75ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 71.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 89.18ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 64.2MB in the end (delta: 6.1MB). 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: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1584]: 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, 58 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 459 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 302 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4/4 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 4 specifications checked. All of them hold - InvariantResult [Line: 1559]: Loop Invariant Derived loop invariant: (0 < (2147483649 + data)) - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: (0 <= data) - InvariantResult [Line: 1581]: Loop Invariant Derived loop invariant: (data == 2) RESULT: Ultimate proved your program to be correct! [2025-01-10 04:43:31,174 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