./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_03_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/CWE191_Integer_Underflow__int_min_postdec_03_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 c181e74caa5970647d9b0b26fecf6df4596608a633c5d25abd71bbc40750c341 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:52:24,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:52:24,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 17:52:24,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:52:24,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:52:24,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:52:24,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:52:24,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:52:24,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:52:24,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:52:24,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:52:24,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:52:24,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:52:24,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:52:24,607 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:52:24,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:52:24,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:52:24,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:52:24,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:52:24,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:52:24,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:52:24,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:52:24,609 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:52:24,610 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:52:24,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:52:24,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:52:24,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:52:24,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:52:24,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:52:24,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:52:24,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:52:24,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:52:24,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:52:24,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:52:24,613 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 -> c181e74caa5970647d9b0b26fecf6df4596608a633c5d25abd71bbc40750c341 [2025-02-06 17:52:24,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:52:24,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:52:24,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:52:24,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:52:24,920 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:52:24,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_03_good.i [2025-02-06 17:52:26,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d03ae7b59/37d111e2e883449a9deb52b26752454b/FLAG0004b4c38 [2025-02-06 17:52:26,612 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:52:26,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_03_good.i [2025-02-06 17:52:26,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d03ae7b59/37d111e2e883449a9deb52b26752454b/FLAG0004b4c38 [2025-02-06 17:52:26,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d03ae7b59/37d111e2e883449a9deb52b26752454b [2025-02-06 17:52:26,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:52:26,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:52:26,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:52:26,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:52:26,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:52:26,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:52:26" (1/1) ... [2025-02-06 17:52:26,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5e12d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:26, skipping insertion in model container [2025-02-06 17:52:26,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:52:26" (1/1) ... [2025-02-06 17:52:26,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:52:27,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:52:27,390 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:52:27,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:52:27,568 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:52:27,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27 WrapperNode [2025-02-06 17:52:27,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:52:27,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:52:27,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:52:27,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:52:27,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,605 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 89 [2025-02-06 17:52:27,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:52:27,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:52:27,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:52:27,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:52:27,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,625 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 17:52:27,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:52:27,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:52:27,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:52:27,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:52:27,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (1/1) ... [2025-02-06 17:52:27,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:52:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:52:27,659 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-02-06 17:52:27,661 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-02-06 17:52:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 17:52:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 17:52:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 17:52:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 17:52:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:52:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:52:27,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:52:27,810 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:52:27,812 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:52:27,972 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-06 17:52:27,972 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:52:27,981 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:52:27,983 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:52:27,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:52:27 BoogieIcfgContainer [2025-02-06 17:52:27,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:52:27,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:52:27,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:52:27,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:52:27,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:52:26" (1/3) ... [2025-02-06 17:52:27,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4def2c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:52:27, skipping insertion in model container [2025-02-06 17:52:27,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:52:27" (2/3) ... [2025-02-06 17:52:27,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4def2c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:52:27, skipping insertion in model container [2025-02-06 17:52:27,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:52:27" (3/3) ... [2025-02-06 17:52:27,993 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_postdec_03_good.i [2025-02-06 17:52:28,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:52:28,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_min_postdec_03_good.i that has 3 procedures, 59 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 17:52:28,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:52:28,052 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;@7f5060cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:52:28,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 17:52:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 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-02-06 17:52:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 17:52:28,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:52:28,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:52:28,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:52:28,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:52:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash 676505045, now seen corresponding path program 1 times [2025-02-06 17:52:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:52:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837650421] [2025-02-06 17:52:28,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:52:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:52:28,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:52:28,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:52:28,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:52:28,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:52:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:52:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:52:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837650421] [2025-02-06 17:52:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837650421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:52:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:52:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:52:28,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483420247] [2025-02-06 17:52:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:52:28,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:52:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:52:28,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:52:28,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:52:28,295 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 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-02-06 17:52:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:52:28,325 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2025-02-06 17:52:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:52:28,327 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-02-06 17:52:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:52:28,331 INFO L225 Difference]: With dead ends: 105 [2025-02-06 17:52:28,332 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 17:52:28,334 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-02-06 17:52:28,336 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:52:28,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:52:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 17:52:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 17:52:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 35 states have internal predecessors, (36), 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-02-06 17:52:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-02-06 17:52:28,369 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2025-02-06 17:52:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:52:28,370 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-02-06 17:52:28,370 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-02-06 17:52:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-02-06 17:52:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 17:52:28,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:52:28,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:52:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:52:28,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:52:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:52:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -603011091, now seen corresponding path program 1 times [2025-02-06 17:52:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:52:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743848876] [2025-02-06 17:52:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:52:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:52:28,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 17:52:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 17:52:28,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:52:28,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:52:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 17:52:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:52:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743848876] [2025-02-06 17:52:28,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743848876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:52:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:52:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:52:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987567042] [2025-02-06 17:52:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:52:28,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:52:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:52:28,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:52:28,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:52:28,466 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-02-06 17:52:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:52:28,479 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-02-06 17:52:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:52:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 21 [2025-02-06 17:52:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:52:28,480 INFO L225 Difference]: With dead ends: 61 [2025-02-06 17:52:28,480 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 17:52:28,481 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-02-06 17:52:28,481 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:52:28,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:52:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 17:52:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 17:52:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:52:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-06 17:52:28,487 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2025-02-06 17:52:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:52:28,488 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-06 17:52:28,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-02-06 17:52:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-06 17:52:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 17:52:28,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:52:28,489 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] [2025-02-06 17:52:28,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 17:52:28,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:52:28,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:52:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 666369048, now seen corresponding path program 1 times [2025-02-06 17:52:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:52:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335098258] [2025-02-06 17:52:28,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:52:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:52:28,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 17:52:28,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 17:52:28,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:52:28,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:52:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 17:52:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:52:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335098258] [2025-02-06 17:52:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335098258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:52:28,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:52:28,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:52:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924476405] [2025-02-06 17:52:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:52:28,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:52:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:52:28,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:52:28,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:52:28,625 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-02-06 17:52:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:52:28,652 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-06 17:52:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:52:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 29 [2025-02-06 17:52:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:52:28,654 INFO L225 Difference]: With dead ends: 36 [2025-02-06 17:52:28,654 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 17:52:28,654 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-02-06 17:52:28,655 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:52:28,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:52:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 17:52:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 17:52:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:52:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-02-06 17:52:28,659 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 29 [2025-02-06 17:52:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:52:28,659 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-02-06 17:52:28,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-02-06 17:52:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-02-06 17:52:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 17:52:28,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:52:28,660 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] [2025-02-06 17:52:28,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:52:28,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:52:28,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:52:28,661 INFO L85 PathProgramCache]: Analyzing trace with hash -817395997, now seen corresponding path program 1 times [2025-02-06 17:52:28,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:52:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64569082] [2025-02-06 17:52:28,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:52:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:52:28,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:52:28,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:52:28,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:52:28,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:52:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 17:52:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:52:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64569082] [2025-02-06 17:52:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64569082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:52:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:52:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:52:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484109847] [2025-02-06 17:52:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:52:28,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:52:28,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:52:28,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:52:28,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:52:28,740 INFO L87 Difference]: Start difference. First operand 35 states and 37 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, (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-02-06 17:52:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:52:28,757 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-02-06 17:52:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:52:28,758 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, (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 30 [2025-02-06 17:52:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:52:28,759 INFO L225 Difference]: With dead ends: 35 [2025-02-06 17:52:28,760 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 17:52:28,760 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-02-06 17:52:28,761 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:52:28,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:52:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 17:52:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 17:52:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:52:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-02-06 17:52:28,770 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2025-02-06 17:52:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:52:28,770 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-02-06 17:52:28,771 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, (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-02-06 17:52:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-02-06 17:52:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 17:52:28,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:52:28,772 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] [2025-02-06 17:52:28,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 17:52:28,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:52:28,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:52:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1674074834, now seen corresponding path program 1 times [2025-02-06 17:52:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:52:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217982854] [2025-02-06 17:52:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:52:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:52:28,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 17:52:28,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 17:52:28,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:52:28,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:52:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 17:52:28,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:52:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217982854] [2025-02-06 17:52:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217982854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:52:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:52:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:52:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838411113] [2025-02-06 17:52:28,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:52:28,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:52:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:52:28,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:52:28,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:52:28,880 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-02-06 17:52:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:52:28,892 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-02-06 17:52:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:52:28,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 39 [2025-02-06 17:52:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:52:28,894 INFO L225 Difference]: With dead ends: 34 [2025-02-06 17:52:28,894 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 17:52:28,895 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-02-06 17:52:28,895 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:52:28,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:52:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 17:52:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 17:52:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:52:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-02-06 17:52:28,902 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 39 [2025-02-06 17:52:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:52:28,903 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-02-06 17:52:28,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-02-06 17:52:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-02-06 17:52:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 17:52:28,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:52:28,904 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] [2025-02-06 17:52:28,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 17:52:28,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:52:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:52:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash 356712286, now seen corresponding path program 1 times [2025-02-06 17:52:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:52:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222338281] [2025-02-06 17:52:28,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:52:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:52:28,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 17:52:28,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 17:52:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:52:28,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:52:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 17:52:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:52:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222338281] [2025-02-06 17:52:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222338281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:52:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:52:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:52:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175553908] [2025-02-06 17:52:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:52:28,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:52:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:52:28,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:52:28,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:52:28,988 INFO L87 Difference]: Start difference. First operand 33 states and 35 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, (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-02-06 17:52:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:52:29,001 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-02-06 17:52:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:52:29,002 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, (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 40 [2025-02-06 17:52:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:52:29,003 INFO L225 Difference]: With dead ends: 33 [2025-02-06 17:52:29,003 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 17:52:29,004 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-02-06 17:52:29,004 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:52:29,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:52:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 17:52:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 17:52:29,006 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-02-06 17:52:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 17:52:29,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-02-06 17:52:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:52:29,007 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 17:52:29,007 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, (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-02-06 17:52:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 17:52:29,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 17:52:29,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 17:52:29,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 17:52:29,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 17:52:29,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 17:52:29,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 17:52:29,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 17:52:29,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 17:52:29,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 17:52:29,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 17:52:29,015 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 17:52:29,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 17:52:29,042 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 17:52:29,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:52:29 BoogieIcfgContainer [2025-02-06 17:52:29,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 17:52:29,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 17:52:29,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 17:52:29,052 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 17:52:29,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:52:27" (3/4) ... [2025-02-06 17:52:29,054 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 17:52:29,060 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 17:52:29,060 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 17:52:29,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 17:52:29,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 17:52:29,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 17:52:29,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 17:52:29,138 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 17:52:29,138 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 17:52:29,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 17:52:29,139 INFO L158 Benchmark]: Toolchain (without parser) took 2411.61ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 88.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2025-02-06 17:52:29,140 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:52:29,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 839.79ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 49.6MB in the end (delta: 58.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 17:52:29,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.94ms. Allocated memory is still 142.6MB. Free memory was 49.6MB in the beginning and 46.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:52:29,141 INFO L158 Benchmark]: Boogie Preprocessor took 26.97ms. Allocated memory is still 142.6MB. Free memory was 46.8MB in the beginning and 45.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:52:29,141 INFO L158 Benchmark]: IcfgBuilder took 349.84ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 100.3MB in the end (delta: -54.8MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-02-06 17:52:29,141 INFO L158 Benchmark]: TraceAbstraction took 1065.49ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 95.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:52:29,141 INFO L158 Benchmark]: Witness Printer took 86.91ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 88.7MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:52:29,142 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.28ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 839.79ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 49.6MB in the end (delta: 58.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.94ms. Allocated memory is still 142.6MB. Free memory was 49.6MB in the beginning and 46.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.97ms. Allocated memory is still 142.6MB. Free memory was 46.8MB in the beginning and 45.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 349.84ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 100.3MB in the end (delta: -54.8MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1065.49ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 95.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 86.91ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 88.7MB in the end (delta: 6.7MB). 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: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: 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, 59 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 552 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 329 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 223 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 52/52 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-02-06 17:52:29,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE