./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_65_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 24d72a2120f95f3cf22949963a59da230e0fbc143a8b1a1c5541a1b542d02a88 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:49:22,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:49:22,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 03:49:23,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:49:23,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:49:23,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:49:23,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:49:23,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:49:23,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:49:23,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:49:23,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:49:23,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:49:23,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:49:23,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:23,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:49:23,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:49:23,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:49:23,028 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/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 -> 24d72a2120f95f3cf22949963a59da230e0fbc143a8b1a1c5541a1b542d02a88 [2025-03-09 03:49:23,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:49:23,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:49:23,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:49:23,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:49:23,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:49:23,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_65_good.i [2025-03-09 03:49:24,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17dd52e94/8d6e426dbd104184bf8bf31323691e0a/FLAG12da6a4db [2025-03-09 03:49:24,895 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:49:24,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_65_good.i [2025-03-09 03:49:24,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17dd52e94/8d6e426dbd104184bf8bf31323691e0a/FLAG12da6a4db [2025-03-09 03:49:24,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17dd52e94/8d6e426dbd104184bf8bf31323691e0a [2025-03-09 03:49:24,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:49:24,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:49:24,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:24,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:49:24,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:49:24,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:24" (1/1) ... [2025-03-09 03:49:24,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2904667a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:24, skipping insertion in model container [2025-03-09 03:49:24,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:24" (1/1) ... [2025-03-09 03:49:24,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:49:25,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:25,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:49:25,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:25,616 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:49:25,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25 WrapperNode [2025-03-09 03:49:25,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:25,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:25,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:49:25,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:49:25,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,663 INFO L138 Inliner]: procedures = 503, calls = 36, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2025-03-09 03:49:25,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:25,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:49:25,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:49:25,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:49:25,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,692 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:49:25,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:49:25,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:49:25,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:49:25,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:49:25,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (1/1) ... [2025-03-09 03:49:25,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:49:25,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:49:25,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:49:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 03:49:25,757 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 03:49:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:49:25,757 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:49:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:49:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-09 03:49:25,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-09 03:49:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:49:25,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:49:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 03:49:25,865 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:49:25,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:49:25,979 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-09 03:49:25,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:49:25,988 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:49:25,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:49:25,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:25 BoogieIcfgContainer [2025-03-09 03:49:25,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:49:25,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:49:25,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:49:25,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:49:25,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:49:24" (1/3) ... [2025-03-09 03:49:25,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7bc8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:25, skipping insertion in model container [2025-03-09 03:49:25,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:25" (2/3) ... [2025-03-09 03:49:25,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7bc8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:25, skipping insertion in model container [2025-03-09 03:49:25,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:25" (3/3) ... [2025-03-09 03:49:25,998 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_65_good.i [2025-03-09 03:49:26,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:49:26,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_65_good.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 03:49:26,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:49:26,067 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;@2e25626c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:49:26,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 03:49:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 03:49:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 03:49:26,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:26,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:26,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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-03-09 03:49:26,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2042419356, now seen corresponding path program 1 times [2025-03-09 03:49:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333954756] [2025-03-09 03:49:26,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:26,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 03:49:26,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 03:49:26,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:26,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:49:26,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333954756] [2025-03-09 03:49:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333954756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 03:49:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687685777] [2025-03-09 03:49:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:26,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 03:49:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:26,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 03:49:26,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 03:49:26,458 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-03-09 03:49:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:26,558 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-09 03:49:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 03:49:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2025-03-09 03:49:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:26,565 INFO L225 Difference]: With dead ends: 64 [2025-03-09 03:49:26,565 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 03:49:26,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 03:49:26,569 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:26,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 231 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 03:49:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-03-09 03:49:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.3) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 03:49:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-09 03:49:26,597 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 12 [2025-03-09 03:49:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:26,598 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-09 03:49:26,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-03-09 03:49:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-09 03:49:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 03:49:26,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:26,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 03:49:26,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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-03-09 03:49:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1109501436, now seen corresponding path program 1 times [2025-03-09 03:49:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693659798] [2025-03-09 03:49:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:26,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 03:49:26,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 03:49:26,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:26,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:49:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693659798] [2025-03-09 03:49:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693659798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:26,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:26,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 03:49:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40412775] [2025-03-09 03:49:26,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:26,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 03:49:26,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:26,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 03:49:26,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 03:49:26,747 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 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-03-09 03:49:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:26,827 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-03-09 03:49:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 03:49:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 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-03-09 03:49:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:26,828 INFO L225 Difference]: With dead ends: 67 [2025-03-09 03:49:26,829 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 03:49:26,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 03:49:26,830 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:26,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 192 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 03:49:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 03:49:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 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-03-09 03:49:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-09 03:49:26,836 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2025-03-09 03:49:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:26,837 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-09 03:49:26,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 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-03-09 03:49:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-09 03:49:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 03:49:26,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:26,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:26,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 03:49:26,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-03-09 03:49:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1767260225, now seen corresponding path program 1 times [2025-03-09 03:49:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:26,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110836737] [2025-03-09 03:49:26,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:26,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 03:49:26,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 03:49:26,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:26,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:49:27,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110836737] [2025-03-09 03:49:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110836737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:27,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:27,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 03:49:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47555936] [2025-03-09 03:49:27,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:27,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 03:49:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:27,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 03:49:27,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 03:49:27,009 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 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-03-09 03:49:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:27,062 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-03-09 03:49:27,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 03:49:27,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 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-03-09 03:49:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:27,063 INFO L225 Difference]: With dead ends: 43 [2025-03-09 03:49:27,063 INFO L226 Difference]: Without dead ends: 42 [2025-03-09 03:49:27,064 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-03-09 03:49:27,065 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:27,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 186 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-09 03:49:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-09 03:49:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 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-03-09 03:49:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-03-09 03:49:27,074 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 28 [2025-03-09 03:49:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:27,074 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-03-09 03:49:27,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 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-03-09 03:49:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-03-09 03:49:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 03:49:27,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:27,075 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:27,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 03:49:27,075 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-03-09 03:49:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1049515841, now seen corresponding path program 1 times [2025-03-09 03:49:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458268247] [2025-03-09 03:49:27,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:27,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 03:49:27,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 03:49:27,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:27,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:49:27,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:27,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458268247] [2025-03-09 03:49:27,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458268247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:27,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:27,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 03:49:27,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305568499] [2025-03-09 03:49:27,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:27,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 03:49:27,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:27,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 03:49:27,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 03:49:27,244 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-09 03:49:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:27,302 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-03-09 03:49:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 03:49:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 29 [2025-03-09 03:49:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:27,304 INFO L225 Difference]: With dead ends: 42 [2025-03-09 03:49:27,304 INFO L226 Difference]: Without dead ends: 41 [2025-03-09 03:49:27,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 03:49:27,305 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:27,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 213 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-09 03:49:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-09 03:49:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 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-03-09 03:49:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-09 03:49:27,312 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 29 [2025-03-09 03:49:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:27,314 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-09 03:49:27,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-09 03:49:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-09 03:49:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 03:49:27,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:27,314 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 03:49:27,315 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-03-09 03:49:27,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1049507865, now seen corresponding path program 1 times [2025-03-09 03:49:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:27,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066425751] [2025-03-09 03:49:27,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:27,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 03:49:27,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 03:49:27,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:27,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:49:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:27,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066425751] [2025-03-09 03:49:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066425751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:27,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:27,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 03:49:27,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109443762] [2025-03-09 03:49:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:27,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 03:49:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:27,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 03:49:27,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 03:49:27,428 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03-09 03:49:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:27,447 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-03-09 03:49:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 03:49:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 29 [2025-03-09 03:49:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:27,451 INFO L225 Difference]: With dead ends: 43 [2025-03-09 03:49:27,452 INFO L226 Difference]: Without dead ends: 40 [2025-03-09 03:49:27,452 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-03-09 03:49:27,453 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:27,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-09 03:49:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-09 03:49:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 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-03-09 03:49:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-09 03:49:27,461 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2025-03-09 03:49:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:27,462 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-09 03:49:27,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03-09 03:49:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-09 03:49:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 03:49:27,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:27,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:27,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 03:49:27,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-03-09 03:49:27,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1824747294, now seen corresponding path program 1 times [2025-03-09 03:49:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:27,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800402301] [2025-03-09 03:49:27,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:27,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 03:49:27,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 03:49:27,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:27,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 03:49:27,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800402301] [2025-03-09 03:49:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800402301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:27,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:27,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:27,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748410872] [2025-03-09 03:49:27,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:27,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:27,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:27,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:27,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:27,577 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:27,586 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-09 03:49:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 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 30 [2025-03-09 03:49:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:27,586 INFO L225 Difference]: With dead ends: 38 [2025-03-09 03:49:27,586 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 03:49:27,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03-09 03:49:27,587 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-03-09 03:49:27,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 03:49:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 03:49:27,588 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-03-09 03:49:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 03:49:27,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2025-03-09 03:49:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:27,588 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 03:49:27,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 03:49:27,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 03:49:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 03:49:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 03:49:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 03:49:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 03:49:27,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 03:49:27,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 03:49:27,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 03:49:27,681 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:49:27,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:49:27 BoogieIcfgContainer [2025-03-09 03:49:27,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:49:27,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:49:27,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:49:27,686 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:49:27,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:25" (3/4) ... [2025-03-09 03:49:27,690 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 03:49:27,694 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 03:49:27,694 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 03:49:27,694 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-03-09 03:49:27,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-09 03:49:27,698 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 03:49:27,698 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 03:49:27,698 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 03:49:27,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 03:49:27,774 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 03:49:27,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:49:27,774 INFO L158 Benchmark]: Toolchain (without parser) took 2838.45ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 127.6MB in the end (delta: -8.2MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-03-09 03:49:27,775 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:27,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.59ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 60.2MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 03:49:27,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.53ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 57.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:49:27,776 INFO L158 Benchmark]: Boogie Preprocessor took 39.85ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 56.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:27,776 INFO L158 Benchmark]: IcfgBuilder took 282.75ms. Allocated memory is still 167.8MB. Free memory was 56.0MB in the beginning and 41.5MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 03:49:27,776 INFO L158 Benchmark]: TraceAbstraction took 1695.84ms. Allocated memory is still 167.8MB. Free memory was 41.1MB in the beginning and 50.5MB in the end (delta: -9.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:27,777 INFO L158 Benchmark]: Witness Printer took 87.77ms. Allocated memory is still 167.8MB. Free memory was 50.5MB in the beginning and 127.6MB in the end (delta: -77.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:49:27,778 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.51ms. Allocated memory is still 201.3MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.59ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 60.2MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.53ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 57.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.85ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 56.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 282.75ms. Allocated memory is still 167.8MB. Free memory was 56.0MB in the beginning and 41.5MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1695.84ms. Allocated memory is still 167.8MB. Free memory was 41.1MB in the beginning and 50.5MB in the end (delta: -9.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.77ms. Allocated memory is still 167.8MB. Free memory was 50.5MB in the beginning and 127.6MB in the end (delta: -77.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: 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, 44 locations, 60 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 983 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 747 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 236 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 33, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 11/11 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-03-09 03:49:27,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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