./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_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/CWE190_Integer_Overflow__int_fscanf_add_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 591c54adc1121b083de0b200a5c7316453eb36621d8c8961d0757a9a42767e91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 15:52:07,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 15:52:07,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 15:52:07,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 15:52:07,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 15:52:07,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 15:52:07,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 15:52:07,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 15:52:07,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 15:52:07,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 15:52:07,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 15:52:07,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 15:52:07,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 15:52:07,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 15:52:07,785 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 15:52:07,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 15:52:07,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 15:52:07,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 15:52:07,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 15:52:07,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 15:52:07,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 15:52:07,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 15:52:07,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 15:52:07,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 15:52:07,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 15:52:07,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 15:52:07,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 15:52:07,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 15:52:07,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 15:52:07,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 15:52:07,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 15:52:07,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 15:52:07,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 15:52:07,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 15:52:07,789 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 -> 591c54adc1121b083de0b200a5c7316453eb36621d8c8961d0757a9a42767e91 [2025-02-06 15:52:08,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 15:52:08,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 15:52:08,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 15:52:08,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 15:52:08,080 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 15:52:08,081 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_fscanf_add_03_good.i [2025-02-06 15:52:09,296 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe3137f91/e5792c4c90fa49c58b704e840238884f/FLAGfdcb3c4f3 [2025-02-06 15:52:09,784 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 15:52:09,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_03_good.i [2025-02-06 15:52:09,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe3137f91/e5792c4c90fa49c58b704e840238884f/FLAGfdcb3c4f3 [2025-02-06 15:52:09,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe3137f91/e5792c4c90fa49c58b704e840238884f [2025-02-06 15:52:09,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 15:52:09,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 15:52:09,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 15:52:09,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 15:52:09,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 15:52:09,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:09" (1/1) ... [2025-02-06 15:52:09,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220636b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:09, skipping insertion in model container [2025-02-06 15:52:09,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:09" (1/1) ... [2025-02-06 15:52:09,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 15:52:10,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 15:52:10,670 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 15:52:10,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 15:52:10,858 INFO L204 MainTranslator]: Completed translation [2025-02-06 15:52:10,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10 WrapperNode [2025-02-06 15:52:10,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 15:52:10,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 15:52:10,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 15:52:10,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 15:52:10,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,914 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2025-02-06 15:52:10,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 15:52:10,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 15:52:10,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 15:52:10,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 15:52:10,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,933 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 15:52:10,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 15:52:10,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 15:52:10,941 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 15:52:10,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 15:52:10,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (1/1) ... [2025-02-06 15:52:10,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 15:52:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:52:10,977 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 15:52:10,980 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 15:52:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 15:52:11,020 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 15:52:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 15:52:11,020 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 15:52:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 15:52:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 15:52:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 15:52:11,153 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 15:52:11,155 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 15:52:11,279 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-06 15:52:11,279 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 15:52:11,289 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 15:52:11,290 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 15:52:11,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:11 BoogieIcfgContainer [2025-02-06 15:52:11,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 15:52:11,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 15:52:11,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 15:52:11,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 15:52:11,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:52:09" (1/3) ... [2025-02-06 15:52:11,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9a15b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:11, skipping insertion in model container [2025-02-06 15:52:11,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:10" (2/3) ... [2025-02-06 15:52:11,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9a15b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:11, skipping insertion in model container [2025-02-06 15:52:11,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:11" (3/3) ... [2025-02-06 15:52:11,299 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_add_03_good.i [2025-02-06 15:52:11,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 15:52:11,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_add_03_good.i that has 3 procedures, 59 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 15:52:11,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 15:52:11,372 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;@480e345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 15:52:11,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 15:52:11,376 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 15:52:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 15:52:11,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:52:11,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:52:11,381 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 15:52:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:52:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 676505076, now seen corresponding path program 1 times [2025-02-06 15:52:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:52:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488454178] [2025-02-06 15:52:11,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:52:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:52:11,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 15:52:11,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 15:52:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:52:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:52:11,601 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 15:52:11,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:52:11,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488454178] [2025-02-06 15:52:11,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488454178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:52:11,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:52:11,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:52:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489713401] [2025-02-06 15:52:11,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:52:11,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:52:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:52:11,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:52:11,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:11,628 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, 2 states have (on average 5.0) 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 15:52:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:52:11,670 INFO L93 Difference]: Finished difference Result 110 states and 143 transitions. [2025-02-06 15:52:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:52:11,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 15:52:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:52:11,676 INFO L225 Difference]: With dead ends: 110 [2025-02-06 15:52:11,676 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 15:52:11,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:11,681 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:52:11,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:52:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 15:52:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 15:52:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.28125) internal successors, (41), 40 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 15:52:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-02-06 15:52:11,718 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 12 [2025-02-06 15:52:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:52:11,720 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-02-06 15:52:11,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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 15:52:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-02-06 15:52:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 15:52:11,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:52:11,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:52:11,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 15:52:11,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:52:11,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:52:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -503179102, now seen corresponding path program 1 times [2025-02-06 15:52:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:52:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631551413] [2025-02-06 15:52:11,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:52:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:52:11,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 15:52:11,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 15:52:11,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:52:11,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:52:11,792 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 15:52:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:52:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631551413] [2025-02-06 15:52:11,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631551413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:52:11,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:52:11,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:52:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870998152] [2025-02-06 15:52:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:52:11,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:52:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:52:11,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:52:11,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:11,796 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 15:52:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:52:11,815 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-02-06 15:52:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:52:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-02-06 15:52:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:52:11,817 INFO L225 Difference]: With dead ends: 47 [2025-02-06 15:52:11,818 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 15:52:11,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:11,819 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 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-02-06 15:52:11,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:52:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 15:52:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 15:52:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 39 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 15:52:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-02-06 15:52:11,827 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2025-02-06 15:52:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:52:11,827 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-02-06 15:52:11,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 15:52:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-02-06 15:52:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 15:52:11,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:52:11,828 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 15:52:11,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 15:52:11,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:52:11,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:52:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash -603011060, now seen corresponding path program 1 times [2025-02-06 15:52:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:52:11,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142143448] [2025-02-06 15:52:11,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:52:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:52:11,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 15:52:11,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 15:52:11,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:52:11,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:52:11,933 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 15:52:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:52:11,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142143448] [2025-02-06 15:52:11,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142143448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:52:11,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:52:11,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:52:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449045776] [2025-02-06 15:52:11,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:52:11,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:52:11,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:52:11,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:52:11,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:11,935 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 15:52:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:52:11,956 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-02-06 15:52:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:52:11,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 15:52:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:52:11,960 INFO L225 Difference]: With dead ends: 46 [2025-02-06 15:52:11,960 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 15:52:11,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:11,961 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:52:11,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:52:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 15:52:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 15:52:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.21875) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 15:52:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-02-06 15:52:11,966 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 21 [2025-02-06 15:52:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:52:11,966 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-02-06 15:52:11,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 15:52:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-02-06 15:52:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 15:52:11,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:52:11,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:52:11,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 15:52:11,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:52:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:52:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1513473669, now seen corresponding path program 1 times [2025-02-06 15:52:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:52:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214996521] [2025-02-06 15:52:11,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:52:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:52:11,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 15:52:11,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 15:52:11,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:52:11,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:52:12,030 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 15:52:12,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:52:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214996521] [2025-02-06 15:52:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214996521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:52:12,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:52:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:52:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913924714] [2025-02-06 15:52:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:52:12,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:52:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:52:12,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:52:12,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:12,032 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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 15:52:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:52:12,051 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-02-06 15:52:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:52:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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 22 [2025-02-06 15:52:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:52:12,052 INFO L225 Difference]: With dead ends: 45 [2025-02-06 15:52:12,052 INFO L226 Difference]: Without dead ends: 44 [2025-02-06 15:52:12,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:12,053 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 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-02-06 15:52:12,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:52:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-06 15:52:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-06 15:52:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 37 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 15:52:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-02-06 15:52:12,058 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2025-02-06 15:52:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:52:12,058 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-02-06 15:52:12,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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 15:52:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-02-06 15:52:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 15:52:12,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:52:12,059 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 15:52:12,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 15:52:12,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:52:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:52:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 666369048, now seen corresponding path program 1 times [2025-02-06 15:52:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:52:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622243937] [2025-02-06 15:52:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:52:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:52:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 15:52:12,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 15:52:12,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:52:12,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:52:12,136 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 15:52:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:52:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622243937] [2025-02-06 15:52:12,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622243937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:52:12,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:52:12,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:52:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637806002] [2025-02-06 15:52:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:52:12,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:52:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:52:12,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:52:12,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:12,139 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 15:52:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:52:12,153 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-02-06 15:52:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:52:12,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 15:52:12,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:52:12,156 INFO L225 Difference]: With dead ends: 44 [2025-02-06 15:52:12,156 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 15:52:12,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:12,157 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:52:12,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:52:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 15:52:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 15:52:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 15:52:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-02-06 15:52:12,164 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 29 [2025-02-06 15:52:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:52:12,165 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-02-06 15:52:12,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 15:52:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-02-06 15:52:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 15:52:12,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:52:12,166 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 15:52:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 15:52:12,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:52:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:52:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1674074834, now seen corresponding path program 1 times [2025-02-06 15:52:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:52:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621524042] [2025-02-06 15:52:12,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:52:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:52:12,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 15:52:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 15:52:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:52:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:52:12,261 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 15:52:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:52:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621524042] [2025-02-06 15:52:12,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621524042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:52:12,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:52:12,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:52:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201544752] [2025-02-06 15:52:12,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:52:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:52:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:52:12,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:52:12,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:12,262 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 15:52:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:52:12,275 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-06 15:52:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:52:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 15:52:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:52:12,277 INFO L225 Difference]: With dead ends: 42 [2025-02-06 15:52:12,277 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 15:52:12,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:52:12,278 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:52:12,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:52:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 15:52:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 15:52:12,280 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 15:52:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 15:52:12,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2025-02-06 15:52:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:52:12,280 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 15:52:12,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 15:52:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 15:52:12,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 15:52:12,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 15:52:12,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 15:52:12,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 15:52:12,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 15:52:12,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 15:52:12,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 15:52:12,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 15:52:12,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 15:52:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 15:52:12,287 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 15:52:12,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 15:52:12,308 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 15:52:12,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:52:12 BoogieIcfgContainer [2025-02-06 15:52:12,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 15:52:12,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 15:52:12,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 15:52:12,314 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 15:52:12,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:11" (3/4) ... [2025-02-06 15:52:12,317 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 15:52:12,322 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 15:52:12,322 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 15:52:12,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 15:52:12,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 15:52:12,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 15:52:12,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 15:52:12,395 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 15:52:12,396 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 15:52:12,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 15:52:12,399 INFO L158 Benchmark]: Toolchain (without parser) took 2558.84ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 88.5MB in the end (delta: 13.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-02-06 15:52:12,399 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:52:12,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1020.26ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 41.6MB in the end (delta: 60.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 15:52:12,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.99ms. Allocated memory is still 142.6MB. Free memory was 41.6MB in the beginning and 39.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:52:12,400 INFO L158 Benchmark]: Boogie Preprocessor took 24.34ms. Allocated memory is still 142.6MB. Free memory was 39.1MB in the beginning and 37.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:52:12,400 INFO L158 Benchmark]: IcfgBuilder took 349.95ms. Allocated memory is still 142.6MB. Free memory was 37.5MB in the beginning and 93.9MB in the end (delta: -56.4MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-02-06 15:52:12,400 INFO L158 Benchmark]: TraceAbstraction took 1020.36ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 94.2MB in the end (delta: -1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:52:12,400 INFO L158 Benchmark]: Witness Printer took 81.68ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 88.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 15:52:12,402 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1020.26ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 41.6MB in the end (delta: 60.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.99ms. Allocated memory is still 142.6MB. Free memory was 41.6MB in the beginning and 39.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.34ms. Allocated memory is still 142.6MB. Free memory was 39.1MB in the beginning and 37.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 349.95ms. Allocated memory is still 142.6MB. Free memory was 37.5MB in the beginning and 93.9MB in the end (delta: -56.4MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1020.36ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 94.2MB in the end (delta: -1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 81.68ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 88.5MB in the end (delta: 5.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: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 0.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 563 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 294 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 18, 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.4s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 32/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 15:52:12,422 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