./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_44_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_rand_sub_44_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 c1b0ff05f553fc163e32b54afd175d37e5bf8dcd51dadab892e8bb49cb8c6dea --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:00:29,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:00:30,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:00:30,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:00:30,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:00:30,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:00:30,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:00:30,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:00:30,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:00:30,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:00:30,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:00:30,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:00:30,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:00:30,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:00:30,072 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:00:30,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:00:30,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:00:30,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:00:30,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:30,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:30,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:30,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:00:30,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:00:30,074 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 -> c1b0ff05f553fc163e32b54afd175d37e5bf8dcd51dadab892e8bb49cb8c6dea [2025-01-10 06:00:30,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:00:30,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:00:30,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:00:30,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:00:30,345 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:00:30,346 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_rand_sub_44_good.i [2025-01-10 06:00:31,617 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca6155305/55f2765a19824869a722386dbe933820/FLAG877f77223 [2025-01-10 06:00:31,931 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:00:31,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_44_good.i [2025-01-10 06:00:31,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca6155305/55f2765a19824869a722386dbe933820/FLAG877f77223 [2025-01-10 06:00:32,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca6155305/55f2765a19824869a722386dbe933820 [2025-01-10 06:00:32,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:00:32,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:00:32,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:32,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:00:32,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:00:32,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:32,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f76c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32, skipping insertion in model container [2025-01-10 06:00:32,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:32,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:00:32,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:32,773 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:00:32,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:32,955 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:00:32,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32 WrapperNode [2025-01-10 06:00:32,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:32,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:32,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:00:32,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:00:32,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:32,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,015 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 113 [2025-01-10 06:00:33,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:33,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:00:33,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:00:33,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:00:33,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,046 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 06:00:33,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:00:33,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:00:33,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:00:33,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:00:33,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (1/1) ... [2025-01-10 06:00:33,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:33,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:33,119 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 06:00:33,141 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 06:00:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 06:00:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 06:00:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 06:00:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 06:00:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:00:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-01-10 06:00:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-01-10 06:00:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:00:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:00:33,308 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:00:33,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:00:33,503 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-01-10 06:00:33,504 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:00:33,510 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:00:33,510 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:00:33,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:33 BoogieIcfgContainer [2025-01-10 06:00:33,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:00:33,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:00:33,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:00:33,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:00:33,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:00:32" (1/3) ... [2025-01-10 06:00:33,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a5370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:33, skipping insertion in model container [2025-01-10 06:00:33,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:32" (2/3) ... [2025-01-10 06:00:33,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a5370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:33, skipping insertion in model container [2025-01-10 06:00:33,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:33" (3/3) ... [2025-01-10 06:00:33,518 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_44_good.i [2025-01-10 06:00:33,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:00:33,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_sub_44_good.i that has 4 procedures, 63 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 06:00:33,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:00:33,576 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;@1bf9047a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:00:33,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 06:00:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 53 states have internal predecessors, (68), 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 06:00:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:00:33,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:33,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:33,588 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 06:00:33,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2014614525, now seen corresponding path program 1 times [2025-01-10 06:00:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:33,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40492737] [2025-01-10 06:00:33,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:33,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:33,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:00:33,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:00:33,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:33,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:33,976 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 06:00:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:33,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40492737] [2025-01-10 06:00:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40492737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:00:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579005056] [2025-01-10 06:00:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:00:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:33,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:00:33,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:00:34,000 INFO L87 Difference]: Start difference. First operand has 63 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 53 states have internal predecessors, (68), 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.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-01-10 06:00:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:34,087 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2025-01-10 06:00:34,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:00:34,089 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-01-10 06:00:34,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:34,094 INFO L225 Difference]: With dead ends: 83 [2025-01-10 06:00:34,095 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 06:00:34,097 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-01-10 06:00:34,100 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:34,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 374 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 06:00:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2025-01-10 06:00:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.44) internal successors, (72), 54 states have internal predecessors, (72), 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 06:00:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2025-01-10 06:00:34,133 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 12 [2025-01-10 06:00:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:34,134 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2025-01-10 06:00:34,134 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-01-10 06:00:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2025-01-10 06:00:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:00:34,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:34,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:34,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:00:34,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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 06:00:34,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1971443469, now seen corresponding path program 1 times [2025-01-10 06:00:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046108279] [2025-01-10 06:00:34,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:34,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:00:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:00:34,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:34,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:34,180 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 06:00:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:34,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046108279] [2025-01-10 06:00:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046108279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:34,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137929134] [2025-01-10 06:00:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:34,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:34,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:34,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:34,183 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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 06:00:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:34,198 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2025-01-10 06:00:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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 13 [2025-01-10 06:00:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:34,200 INFO L225 Difference]: With dead ends: 63 [2025-01-10 06:00:34,200 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 06:00:34,200 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 06:00:34,201 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 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 06:00:34,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 06:00:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 06:00:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.4) internal successors, (70), 53 states have internal predecessors, (70), 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 06:00:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-01-10 06:00:34,213 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 13 [2025-01-10 06:00:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:34,213 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-01-10 06:00:34,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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 06:00:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-01-10 06:00:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:00:34,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:34,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:34,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:00:34,214 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-01-10 06:00:34,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1971459325, now seen corresponding path program 1 times [2025-01-10 06:00:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943574914] [2025-01-10 06:00:34,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:34,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:34,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:00:34,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:00:34,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:34,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:34,329 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 06:00:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943574914] [2025-01-10 06:00:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943574914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:00:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540355697] [2025-01-10 06:00:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:00:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:34,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:00:34,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:00:34,332 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. 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 06:00:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:34,385 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-01-10 06:00:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:00:34,386 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 06:00:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:34,387 INFO L225 Difference]: With dead ends: 64 [2025-01-10 06:00:34,387 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 06:00:34,388 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 06:00:34,388 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 15 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:34,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 321 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 06:00:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-01-10 06:00:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.38) internal successors, (69), 53 states have internal predecessors, (69), 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 06:00:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2025-01-10 06:00:34,396 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 13 [2025-01-10 06:00:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:34,396 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2025-01-10 06:00:34,396 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 06:00:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2025-01-10 06:00:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 06:00:34,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:34,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:34,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:00:34,399 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 06:00:34,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash 985205542, now seen corresponding path program 1 times [2025-01-10 06:00:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163014817] [2025-01-10 06:00:34,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:34,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:00:34,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:00:34,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:34,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:34,499 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 06:00:34,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:34,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163014817] [2025-01-10 06:00:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163014817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:34,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:34,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:00:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585116290] [2025-01-10 06:00:34,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:00:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:34,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:00:34,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:00:34,501 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 06:00:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:34,515 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2025-01-10 06:00:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:00:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2025-01-10 06:00:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:34,516 INFO L225 Difference]: With dead ends: 105 [2025-01-10 06:00:34,516 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 06:00:34,516 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 06:00:34,517 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 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 06:00:34,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 06:00:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-10 06:00:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 47 states have internal predecessors, (61), 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 06:00:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-01-10 06:00:34,521 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 14 [2025-01-10 06:00:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:34,521 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-01-10 06:00:34,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 06:00:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-01-10 06:00:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 06:00:34,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:34,522 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, 1, 1, 1, 1] [2025-01-10 06:00:34,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:00:34,522 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 06:00:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1490035654, now seen corresponding path program 1 times [2025-01-10 06:00:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886523242] [2025-01-10 06:00:34,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:34,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:00:34,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:00:34,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:34,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:34,656 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 06:00:34,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:34,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886523242] [2025-01-10 06:00:34,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886523242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:34,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:34,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:00:34,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52786486] [2025-01-10 06:00:34,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:34,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:00:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:34,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:00:34,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:00:34,659 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 06:00:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:34,676 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2025-01-10 06:00:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:00:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 32 [2025-01-10 06:00:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:34,678 INFO L225 Difference]: With dead ends: 55 [2025-01-10 06:00:34,678 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 06:00:34,678 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 06:00:34,679 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:34,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 143 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 06:00:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 06:00:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 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 06:00:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-01-10 06:00:34,690 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 32 [2025-01-10 06:00:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:34,690 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-01-10 06:00:34,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 06:00:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-01-10 06:00:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 06:00:34,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:34,691 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, 1, 1, 1, 1] [2025-01-10 06:00:34,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:00:34,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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 06:00:34,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1700640355, now seen corresponding path program 1 times [2025-01-10 06:00:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:34,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485028128] [2025-01-10 06:00:34,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:34,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:34,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:00:34,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:00:34,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:34,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:34,874 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 06:00:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485028128] [2025-01-10 06:00:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485028128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:34,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:34,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:00:34,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493983800] [2025-01-10 06:00:34,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:34,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:00:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:34,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:00:34,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:00:34,876 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 06:00:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:34,915 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2025-01-10 06:00:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:00:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 34 [2025-01-10 06:00:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:34,916 INFO L225 Difference]: With dead ends: 51 [2025-01-10 06:00:34,917 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 06:00:34,917 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 06:00:34,917 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:34,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 06:00:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 06:00:34,918 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 06:00:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 06:00:34,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2025-01-10 06:00:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:34,919 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:00:34,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 06:00:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 06:00:34,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 06:00:34,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 06:00:34,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 06:00:34,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 06:00:34,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 06:00:34,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:00:34,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 06:00:34,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 06:00:35,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:00:35,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:00:35 BoogieIcfgContainer [2025-01-10 06:00:35,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:00:35,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:00:35,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:00:35,052 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:00:35,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:33" (3/4) ... [2025-01-10 06:00:35,054 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:00:35,059 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 06:00:35,060 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 06:00:35,060 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-01-10 06:00:35,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-10 06:00:35,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 06:00:35,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 06:00:35,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:00:35,117 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:00:35,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:00:35,117 INFO L158 Benchmark]: Toolchain (without parser) took 2951.81ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 85.2MB in the end (delta: 19.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-01-10 06:00:35,117 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 167.8MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:00:35,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 790.41ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 42.5MB in the end (delta: 61.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 06:00:35,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.90ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 39.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:00:35,118 INFO L158 Benchmark]: Boogie Preprocessor took 49.52ms. Allocated memory is still 142.6MB. Free memory was 39.8MB in the beginning and 38.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:00:35,118 INFO L158 Benchmark]: RCFGBuilder took 442.93ms. Allocated memory is still 142.6MB. Free memory was 38.0MB in the beginning and 90.9MB in the end (delta: -52.8MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2025-01-10 06:00:35,118 INFO L158 Benchmark]: TraceAbstraction took 1538.47ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 91.5MB in the end (delta: -1.4MB). Peak memory consumption was 230.5kB. Max. memory is 16.1GB. [2025-01-10 06:00:35,119 INFO L158 Benchmark]: Witness Printer took 65.00ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.2MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:00:35,119 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.29ms. Allocated memory is still 167.8MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 790.41ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 42.5MB in the end (delta: 61.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.90ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 39.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.52ms. Allocated memory is still 142.6MB. Free memory was 39.8MB in the beginning and 38.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 442.93ms. Allocated memory is still 142.6MB. Free memory was 38.0MB in the beginning and 90.9MB in the end (delta: -52.8MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1538.47ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 91.5MB in the end (delta: -1.4MB). Peak memory consumption was 230.5kB. Max. memory is 16.1GB. * Witness Printer took 65.00ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.2MB in the end (delta: 6.3MB). 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: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: 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, 63 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 1442 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1045 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 397 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5/5 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 06:00:35,132 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