./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_65_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 ac0a1a6e382dc67c16c6b72d2239e81c389e4f53fb61fde23070e142dd3fc6a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 05:28:58,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 05:28:58,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 05:28:58,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 05:28:58,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 05:28:59,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 05:28:59,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 05:28:59,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 05:28:59,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 05:28:59,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 05:28:59,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 05:28:59,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 05:28:59,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 05:28:59,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 05:28:59,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:28:59,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:28:59,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:28:59,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 05:28:59,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 05:28:59,005 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 -> ac0a1a6e382dc67c16c6b72d2239e81c389e4f53fb61fde23070e142dd3fc6a0 [2025-01-10 05:28:59,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 05:28:59,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 05:28:59,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 05:28:59,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 05:28:59,248 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 05:28:59,248 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_fscanf_multiply_65_good.i [2025-01-10 05:29:00,425 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2253f0cab/3607d2e0fb164baab184b20e767f3c26/FLAGe9d60e88b [2025-01-10 05:29:00,799 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 05:29:00,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_65_good.i [2025-01-10 05:29:00,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2253f0cab/3607d2e0fb164baab184b20e767f3c26/FLAGe9d60e88b [2025-01-10 05:29:00,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2253f0cab/3607d2e0fb164baab184b20e767f3c26 [2025-01-10 05:29:01,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 05:29:01,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 05:29:01,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 05:29:01,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 05:29:01,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 05:29:01,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:29:00" (1/1) ... [2025-01-10 05:29:01,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e16a5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01, skipping insertion in model container [2025-01-10 05:29:01,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:29:00" (1/1) ... [2025-01-10 05:29:01,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 05:29:01,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:29:01,568 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 05:29:01,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:29:01,708 INFO L204 MainTranslator]: Completed translation [2025-01-10 05:29:01,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01 WrapperNode [2025-01-10 05:29:01,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 05:29:01,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 05:29:01,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 05:29:01,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 05:29:01,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,741 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 61 [2025-01-10 05:29:01,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 05:29:01,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 05:29:01,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 05:29:01,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 05:29:01,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,757 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 05:29:01,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 05:29:01,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 05:29:01,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 05:29:01,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 05:29:01,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (1/1) ... [2025-01-10 05:29:01,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:29:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:29:01,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 05:29:01,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 05:29:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 05:29:01,814 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 05:29:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 05:29:01,814 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 05:29:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 05:29:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-01-10 05:29:01,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-01-10 05:29:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 05:29:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 05:29:01,934 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 05:29:01,936 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 05:29:02,017 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-10 05:29:02,017 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 05:29:02,024 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 05:29:02,024 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 05:29:02,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:29:02 BoogieIcfgContainer [2025-01-10 05:29:02,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 05:29:02,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 05:29:02,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 05:29:02,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 05:29:02,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:29:00" (1/3) ... [2025-01-10 05:29:02,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ab8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:29:02, skipping insertion in model container [2025-01-10 05:29:02,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:01" (2/3) ... [2025-01-10 05:29:02,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ab8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:29:02, skipping insertion in model container [2025-01-10 05:29:02,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:29:02" (3/3) ... [2025-01-10 05:29:02,035 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_multiply_65_good.i [2025-01-10 05:29:02,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 05:29:02,047 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_multiply_65_good.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 05:29:02,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 05:29:02,092 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;@57304106, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 05:29:02,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 05:29:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 05:29:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 05:29:02,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:02,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:02,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 05:29:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash -675833385, now seen corresponding path program 1 times [2025-01-10 05:29:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544491264] [2025-01-10 05:29:02,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:02,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 05:29:02,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 05:29:02,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:02,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544491264] [2025-01-10 05:29:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544491264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 05:29:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672857524] [2025-01-10 05:29:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 05:29:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:02,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 05:29:02,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 05:29:02,386 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:02,469 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-01-10 05:29:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 05:29:02,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-10 05:29:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:02,474 INFO L225 Difference]: With dead ends: 65 [2025-01-10 05:29:02,474 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 05:29:02,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 05:29:02,479 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:02,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 219 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 05:29:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-01-10 05:29:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:29:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-01-10 05:29:02,509 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 13 [2025-01-10 05:29:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:02,509 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-01-10 05:29:02,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-01-10 05:29:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 05:29:02,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:02,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:02,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 05:29:02,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 05:29:02,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash 524001635, now seen corresponding path program 1 times [2025-01-10 05:29:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:02,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307575593] [2025-01-10 05:29:02,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:02,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:02,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 05:29:02,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 05:29:02,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:02,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307575593] [2025-01-10 05:29:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307575593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:02,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:29:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878591442] [2025-01-10 05:29:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:02,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:02,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:02,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:02,560 INFO L87 Difference]: Start difference. First operand 45 states and 54 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:02,584 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-01-10 05:29:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:02,584 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-10 05:29:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:02,585 INFO L225 Difference]: With dead ends: 45 [2025-01-10 05:29:02,586 INFO L226 Difference]: Without dead ends: 43 [2025-01-10 05:29:02,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:02,587 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:02,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-10 05:29:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-10 05:29:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:29:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-01-10 05:29:02,596 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2025-01-10 05:29:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:02,596 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-10 05:29:02,596 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-01-10 05:29:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 05:29:02,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:02,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:02,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 05:29:02,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 05:29:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash 523324419, now seen corresponding path program 1 times [2025-01-10 05:29:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:02,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765301331] [2025-01-10 05:29:02,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:02,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 05:29:02,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 05:29:02,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:02,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765301331] [2025-01-10 05:29:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765301331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:29:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731631459] [2025-01-10 05:29:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:02,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:02,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:02,650 INFO L87 Difference]: Start difference. First operand 43 states and 51 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:02,662 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-01-10 05:29:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:02,662 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-10 05:29:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:02,663 INFO L225 Difference]: With dead ends: 43 [2025-01-10 05:29:02,663 INFO L226 Difference]: Without dead ends: 42 [2025-01-10 05:29:02,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:02,664 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:02,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-10 05:29:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-10 05:29:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:29:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-01-10 05:29:02,672 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 14 [2025-01-10 05:29:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:02,672 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-01-10 05:29:02,672 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-01-10 05:29:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 05:29:02,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:02,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:02,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 05:29:02,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 05:29:02,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -956812124, now seen corresponding path program 1 times [2025-01-10 05:29:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653122265] [2025-01-10 05:29:02,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:02,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 05:29:02,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 05:29:02,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:02,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653122265] [2025-01-10 05:29:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653122265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:29:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347129890] [2025-01-10 05:29:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:02,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:02,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:02,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:02,719 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:02,738 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-01-10 05:29:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-10 05:29:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:02,740 INFO L225 Difference]: With dead ends: 42 [2025-01-10 05:29:02,740 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 05:29:02,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:02,741 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:02,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 05:29:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 05:29:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:29:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-01-10 05:29:02,747 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 15 [2025-01-10 05:29:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:02,747 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-10 05:29:02,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:29:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-01-10 05:29:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 05:29:02,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:02,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 05:29:02,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 05:29:02,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:02,748 INFO L85 PathProgramCache]: Analyzing trace with hash 249591566, now seen corresponding path program 1 times [2025-01-10 05:29:02,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:02,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054828525] [2025-01-10 05:29:02,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:02,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:02,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 05:29:02,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 05:29:02,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:02,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054828525] [2025-01-10 05:29:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054828525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:02,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:02,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 05:29:02,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861205945] [2025-01-10 05:29:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:02,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 05:29:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:02,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 05:29:02,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 05:29:02,864 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:29:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:02,903 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-01-10 05:29:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 05:29:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-10 05:29:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:02,905 INFO L225 Difference]: With dead ends: 47 [2025-01-10 05:29:02,905 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 05:29:02,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 05:29:02,906 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:02,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 05:29:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 05:29:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:29:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-10 05:29:02,914 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2025-01-10 05:29:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:02,914 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-10 05:29:02,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:29:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-10 05:29:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 05:29:02,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:02,915 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:02,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 05:29:02,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 05:29:02,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1122564248, now seen corresponding path program 1 times [2025-01-10 05:29:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:02,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910900471] [2025-01-10 05:29:02,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 05:29:02,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 05:29:02,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:02,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:03,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910900471] [2025-01-10 05:29:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910900471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:03,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:03,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 05:29:03,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093203545] [2025-01-10 05:29:03,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:03,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:03,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:03,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:03,002 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:29:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:03,014 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-01-10 05:29:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:03,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-10 05:29:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:03,015 INFO L225 Difference]: With dead ends: 46 [2025-01-10 05:29:03,015 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 05:29:03,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:03,016 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 100 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-01-10 05:29:03,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 100 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 05:29:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 05:29:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 05:29:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-01-10 05:29:03,018 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2025-01-10 05:29:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:03,018 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-01-10 05:29:03,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:29:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-01-10 05:29:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 05:29:03,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:03,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 05:29:03,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 05:29:03,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1381739486, now seen corresponding path program 1 times [2025-01-10 05:29:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391833075] [2025-01-10 05:29:03,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:03,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 05:29:03,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 05:29:03,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:03,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:03,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:03,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391833075] [2025-01-10 05:29:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391833075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:03,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:03,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 05:29:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735297057] [2025-01-10 05:29:03,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:03,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:03,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:03,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:03,125 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 05:29:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:03,136 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-01-10 05:29:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:03,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-01-10 05:29:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:03,137 INFO L225 Difference]: With dead ends: 29 [2025-01-10 05:29:03,137 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 05:29:03,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:03,137 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:03,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 05:29:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 05:29:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 05:29:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 05:29:03,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-01-10 05:29:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:03,140 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 05:29:03,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 05:29:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 05:29:03,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 05:29:03,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 05:29:03,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 05:29:03,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 05:29:03,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 05:29:03,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 05:29:03,146 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:03,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 05:29:03,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 05:29:03,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:29:03 BoogieIcfgContainer [2025-01-10 05:29:03,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 05:29:03,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 05:29:03,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 05:29:03,259 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 05:29:03,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:29:02" (3/4) ... [2025-01-10 05:29:03,261 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 05:29:03,265 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 05:29:03,266 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 05:29:03,266 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-01-10 05:29:03,270 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-10 05:29:03,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 05:29:03,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 05:29:03,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 05:29:03,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 05:29:03,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 05:29:03,334 INFO L158 Benchmark]: Toolchain (without parser) took 2333.37ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 49.5MB in the end (delta: 53.4MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2025-01-10 05:29:03,335 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:29:03,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.40ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 44.2MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 05:29:03,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.86ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 41.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:29:03,336 INFO L158 Benchmark]: Boogie Preprocessor took 23.53ms. Allocated memory is still 142.6MB. Free memory was 41.3MB in the beginning and 40.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:29:03,336 INFO L158 Benchmark]: RCFGBuilder took 259.56ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 97.0MB in the end (delta: -56.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-01-10 05:29:03,336 INFO L158 Benchmark]: TraceAbstraction took 1231.13ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 55.0MB in the end (delta: 41.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-01-10 05:29:03,337 INFO L158 Benchmark]: Witness Printer took 74.88ms. Allocated memory is still 142.6MB. Free memory was 55.0MB in the beginning and 49.5MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:29:03,338 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.40ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 44.2MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.86ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 41.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.53ms. Allocated memory is still 142.6MB. Free memory was 41.3MB in the beginning and 40.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.56ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 97.0MB in the end (delta: -56.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1231.13ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 55.0MB in the end (delta: 41.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 74.88ms. Allocated memory is still 142.6MB. Free memory was 55.0MB in the beginning and 49.5MB in the end (delta: 5.5MB). There was no memory consumed. 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: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: 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 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 753 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 498 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 255 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=1, InterpolantAutomatonStates: 29, 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 05:29:03,354 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