./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 896adc69290cd6e5fe510e16215aa5d90daec7b380f7c7ccd8908fa85c2f6917 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:35:13,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:35:13,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:35:13,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:35:13,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:35:13,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:35:13,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:35:13,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:35:13,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:35:13,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:35:13,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:35:13,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:35:13,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:35:13,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:35:13,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:35:13,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:35:13,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:35:13,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:35:13,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:35:13,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:35:13,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:35:13,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:35:13,325 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 896adc69290cd6e5fe510e16215aa5d90daec7b380f7c7ccd8908fa85c2f6917 [2025-03-17 02:35:13,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:35:13,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:35:13,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:35:13,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:35:13,601 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:35:13,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i [2025-03-17 02:35:14,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac554bee6/fffe605a5d904f93ba995b63d133752f/FLAGea60a6cf6 [2025-03-17 02:35:15,139 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:35:15,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i [2025-03-17 02:35:15,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac554bee6/fffe605a5d904f93ba995b63d133752f/FLAGea60a6cf6 [2025-03-17 02:35:15,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac554bee6/fffe605a5d904f93ba995b63d133752f [2025-03-17 02:35:15,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:35:15,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:35:15,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:35:15,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:35:15,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:35:15,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b694244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15, skipping insertion in model container [2025-03-17 02:35:15,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:35:15,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i[913,926] [2025-03-17 02:35:15,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:35:15,420 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:35:15,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i[913,926] [2025-03-17 02:35:15,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:35:15,477 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:35:15,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15 WrapperNode [2025-03-17 02:35:15,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:35:15,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:35:15,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:35:15,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:35:15,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,529 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-17 02:35:15,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:35:15,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:35:15,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:35:15,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:35:15,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,567 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:35:15,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:35:15,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:35:15,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:35:15,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:35:15,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (1/1) ... [2025-03-17 02:35:15,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:35:15,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:35:15,620 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-17 02:35:15,626 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-17 02:35:15,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:35:15,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:35:15,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:35:15,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:35:15,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:35:15,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:35:15,693 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:35:15,694 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:35:16,001 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~bitwise10#1; [2025-03-17 02:35:16,023 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 02:35:16,023 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:35:16,037 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:35:16,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:35:16,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:16 BoogieIcfgContainer [2025-03-17 02:35:16,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:35:16,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:35:16,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:35:16,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:35:16,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:35:15" (1/3) ... [2025-03-17 02:35:16,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239cdd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:16, skipping insertion in model container [2025-03-17 02:35:16,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:15" (2/3) ... [2025-03-17 02:35:16,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239cdd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:16, skipping insertion in model container [2025-03-17 02:35:16,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:16" (3/3) ... [2025-03-17 02:35:16,048 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-68.i [2025-03-17 02:35:16,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:35:16,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-68.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:35:16,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:35:16,126 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;@cfd45ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:35:16,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:35:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:35:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:35:16,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:16,139 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:16,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:16,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:16,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1289169048, now seen corresponding path program 1 times [2025-03-17 02:35:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:35:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425123252] [2025-03-17 02:35:16,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:35:16,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:35:16,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:35:16,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:16,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 02:35:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:35:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425123252] [2025-03-17 02:35:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425123252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:35:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238702714] [2025-03-17 02:35:16,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:35:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:35:16,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:35:16,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:35:16,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:35:16,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:35:16,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:16,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:16,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:35:16,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:35:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 02:35:16,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:35:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238702714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:35:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:35:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:35:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754890324] [2025-03-17 02:35:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:35:16,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:35:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:35:16,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:35:16,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:35:16,537 INFO L87 Difference]: Start difference. First operand has 53 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:35:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:35:16,553 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2025-03-17 02:35:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:35:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2025-03-17 02:35:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:35:16,561 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:35:16,561 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 02:35:16,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:35:16,566 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:35:16,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:35:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 02:35:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 02:35:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:35:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-03-17 02:35:16,595 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 75 [2025-03-17 02:35:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:35:16,596 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-03-17 02:35:16,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:35:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-03-17 02:35:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:35:16,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:16,598 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:16,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:35:16,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:35:16,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1833957734, now seen corresponding path program 1 times [2025-03-17 02:35:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:35:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642718983] [2025-03-17 02:35:16,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:35:16,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:35:16,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:35:16,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:16,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:35:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:35:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642718983] [2025-03-17 02:35:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642718983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:35:17,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:35:17,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:35:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958731913] [2025-03-17 02:35:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:35:17,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:35:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:35:17,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:35:17,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:35:17,109 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:35:17,206 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2025-03-17 02:35:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:35:17,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2025-03-17 02:35:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:35:17,208 INFO L225 Difference]: With dead ends: 97 [2025-03-17 02:35:17,208 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 02:35:17,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:35:17,209 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 64 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:35:17,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 98 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:35:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 02:35:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 02:35:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:35:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-17 02:35:17,223 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 75 [2025-03-17 02:35:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:35:17,224 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-17 02:35:17,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-17 02:35:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 02:35:17,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:17,226 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:17,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:35:17,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:17,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:17,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1822078531, now seen corresponding path program 1 times [2025-03-17 02:35:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:35:17,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893523085] [2025-03-17 02:35:17,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:35:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 02:35:17,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 02:35:17,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:17,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:35:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:35:18,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893523085] [2025-03-17 02:35:18,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893523085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:35:18,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:35:18,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:35:18,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031316758] [2025-03-17 02:35:18,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:35:18,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:35:18,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:35:18,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:35:18,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:35:18,185 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:35:18,636 INFO L93 Difference]: Finished difference Result 221 states and 316 transitions. [2025-03-17 02:35:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:35:18,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2025-03-17 02:35:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:35:18,638 INFO L225 Difference]: With dead ends: 221 [2025-03-17 02:35:18,639 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 02:35:18,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:35:18,640 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 288 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:35:18,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 402 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:35:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 02:35:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 93. [2025-03-17 02:35:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:35:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-03-17 02:35:18,664 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 76 [2025-03-17 02:35:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:35:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-03-17 02:35:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-03-17 02:35:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 02:35:18,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:18,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:35:18,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1100655337, now seen corresponding path program 1 times [2025-03-17 02:35:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:35:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220062136] [2025-03-17 02:35:18,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:35:18,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 02:35:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 02:35:18,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:35:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:35:19,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220062136] [2025-03-17 02:35:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220062136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:35:19,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:35:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:35:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615752526] [2025-03-17 02:35:19,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:35:19,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:35:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:35:19,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:35:19,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:35:19,244 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:35:19,705 INFO L93 Difference]: Finished difference Result 214 states and 301 transitions. [2025-03-17 02:35:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:35:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2025-03-17 02:35:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:35:19,708 INFO L225 Difference]: With dead ends: 214 [2025-03-17 02:35:19,708 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 02:35:19,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:35:19,709 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 195 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:35:19,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 341 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:35:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 02:35:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 94. [2025-03-17 02:35:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:35:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2025-03-17 02:35:19,728 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 77 [2025-03-17 02:35:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:35:19,728 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2025-03-17 02:35:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2025-03-17 02:35:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 02:35:19,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:19,730 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:19,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:35:19,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 252654360, now seen corresponding path program 1 times [2025-03-17 02:35:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:35:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76721429] [2025-03-17 02:35:19,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:35:19,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 02:35:19,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 02:35:19,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:19,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:35:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413831348] [2025-03-17 02:35:19,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:19,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:35:19,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:35:19,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:35:19,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:35:19,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 02:35:19,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 02:35:19,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:19,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:35:19,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:35:19,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 02:35:19,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 02:35:19,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:19,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:35:20,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:35:20,033 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:35:20,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:35:20,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:35:20,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:35:20,243 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 02:35:20,304 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:35:20,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:35:20 BoogieIcfgContainer [2025-03-17 02:35:20,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:35:20,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:35:20,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:35:20,311 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:35:20,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:16" (3/4) ... [2025-03-17 02:35:20,313 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:35:20,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:35:20,315 INFO L158 Benchmark]: Toolchain (without parser) took 5149.39ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.7MB in the beginning and 137.9MB in the end (delta: -25.2MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2025-03-17 02:35:20,315 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:35:20,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.31ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:35:20,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.78ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:35:20,316 INFO L158 Benchmark]: Boogie Preprocessor took 56.67ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:35:20,316 INFO L158 Benchmark]: IcfgBuilder took 447.16ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 70.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 02:35:20,316 INFO L158 Benchmark]: TraceAbstraction took 4268.99ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.2MB in the beginning and 137.9MB in the end (delta: -68.7MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-03-17 02:35:20,317 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 137.9MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:35:20,318 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.31ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.78ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.67ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 447.16ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 70.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4268.99ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.2MB in the beginning and 137.9MB in the end (delta: -68.7MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 137.9MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] double last_1_var_1_9 = 4.6; [L36] unsigned char last_1_var_1_12 = 100; [L37] unsigned char last_1_var_1_14 = 0; [L38] signed long int last_1_var_1_16 = 0; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L108] last_1_var_1_9 = var_1_9 [L109] last_1_var_1_12 = var_1_12 [L110] last_1_var_1_14 = var_1_14 [L111] last_1_var_1_16 = var_1_16 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L91] var_1_5 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] var_1_7 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] var_1_8 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L98] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L100] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L101] var_1_10 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L102] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L103] var_1_13 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L105] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L105] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L122] RET updateVariables() [L123] CALL step() [L42] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L43] COND FALSE !(\read(last_1_var_1_14)) [L54] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L56] var_1_16 = last_1_var_1_12 [L57] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L58] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L59] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L60] COND FALSE !(stepLocal_5 >= var_1_16) [L63] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L66] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L67] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L67] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L68] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L72] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L73] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L74] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L77] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L78] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L81] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L82] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L83] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L85] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=23/5] [L86] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L87] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=2] [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=2] [L114-L115] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-253, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 913 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 597 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 316 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 4 MinimizatonAttempts, 152 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 216 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 882/900 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:35:20,340 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 896adc69290cd6e5fe510e16215aa5d90daec7b380f7c7ccd8908fa85c2f6917 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:35:22,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:35:22,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:35:22,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:35:22,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:35:22,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:35:22,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:35:22,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:35:22,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:35:22,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:35:22,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:35:22,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:35:22,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:35:22,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:35:22,706 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:35:22,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:35:22,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:35:22,706 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:35:22,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:35:22,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:35:22,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:35:22,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:35:22,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:35:22,709 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 896adc69290cd6e5fe510e16215aa5d90daec7b380f7c7ccd8908fa85c2f6917 [2025-03-17 02:35:23,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:35:23,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:35:23,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:35:23,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:35:23,014 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:35:23,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i [2025-03-17 02:35:24,388 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c175ae0/db43d8d371c94d8c944e6d19d2cc0e4e/FLAGb05192383 [2025-03-17 02:35:24,614 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:35:24,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i [2025-03-17 02:35:24,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c175ae0/db43d8d371c94d8c944e6d19d2cc0e4e/FLAGb05192383 [2025-03-17 02:35:24,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c175ae0/db43d8d371c94d8c944e6d19d2cc0e4e [2025-03-17 02:35:24,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:35:24,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:35:24,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:35:24,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:35:24,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:35:24,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:24,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2645a582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24, skipping insertion in model container [2025-03-17 02:35:24,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:24,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:35:24,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i[913,926] [2025-03-17 02:35:24,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:35:24,852 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:35:24,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-68.i[913,926] [2025-03-17 02:35:24,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:35:24,910 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:35:24,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24 WrapperNode [2025-03-17 02:35:24,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:35:24,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:35:24,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:35:24,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:35:24,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:24,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:24,960 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 02:35:24,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:35:24,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:35:24,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:35:24,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:35:24,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:24,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:24,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:35:25,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:35:25,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:35:25,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:35:25,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:35:25,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (1/1) ... [2025-03-17 02:35:25,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:35:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:35:25,054 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-17 02:35:25,059 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-17 02:35:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:35:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:35:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:35:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:35:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:35:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:35:25,149 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:35:25,151 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:35:25,531 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 02:35:25,531 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:35:25,541 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:35:25,541 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:35:25,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:25 BoogieIcfgContainer [2025-03-17 02:35:25,541 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:35:25,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:35:25,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:35:25,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:35:25,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:35:24" (1/3) ... [2025-03-17 02:35:25,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cb41ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:25, skipping insertion in model container [2025-03-17 02:35:25,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:24" (2/3) ... [2025-03-17 02:35:25,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cb41ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:25, skipping insertion in model container [2025-03-17 02:35:25,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:25" (3/3) ... [2025-03-17 02:35:25,550 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-68.i [2025-03-17 02:35:25,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:35:25,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-68.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:35:25,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:35:25,619 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;@6371be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:35:25,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:35:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:35:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 02:35:25,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:25,629 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:25,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1540387019, now seen corresponding path program 1 times [2025-03-17 02:35:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:35:25,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383034883] [2025-03-17 02:35:25,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:25,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:35:25,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:35:25,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:35:25,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:35:25,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 02:35:25,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 02:35:25,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:25,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:25,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:35:25,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:35:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-17 02:35:25,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:35:25,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:35:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383034883] [2025-03-17 02:35:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383034883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:35:25,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:35:25,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:35:25,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062873604] [2025-03-17 02:35:25,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:35:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:35:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:35:25,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:35:25,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:35:25,874 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:35:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:35:25,890 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2025-03-17 02:35:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:35:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-03-17 02:35:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:35:25,912 INFO L225 Difference]: With dead ends: 83 [2025-03-17 02:35:25,913 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 02:35:25,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:35:25,917 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:35:25,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:35:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 02:35:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 02:35:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:35:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-03-17 02:35:25,949 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 71 [2025-03-17 02:35:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:35:25,949 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-03-17 02:35:25,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:35:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-03-17 02:35:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 02:35:25,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:25,952 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:25,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:35:26,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:35:26,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:26,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash -375669193, now seen corresponding path program 1 times [2025-03-17 02:35:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:35:26,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756321485] [2025-03-17 02:35:26,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:26,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:35:26,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:35:26,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:35:26,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:35:26,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 02:35:26,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 02:35:26,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:26,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:26,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:35:26,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:35:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:35:26,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:35:26,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:35:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756321485] [2025-03-17 02:35:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756321485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:35:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:35:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:35:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745082007] [2025-03-17 02:35:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:35:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:35:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:35:26,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:35:26,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:35:26,686 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:35:28,014 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2025-03-17 02:35:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:35:28,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-03-17 02:35:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:35:28,026 INFO L225 Difference]: With dead ends: 177 [2025-03-17 02:35:28,026 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 02:35:28,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:35:28,027 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 172 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:35:28,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 264 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 02:35:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 02:35:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 68. [2025-03-17 02:35:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:35:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2025-03-17 02:35:28,047 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 71 [2025-03-17 02:35:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:35:28,048 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2025-03-17 02:35:28,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2025-03-17 02:35:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 02:35:28,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:28,049 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:28,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:35:28,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:35:28,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:28,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash -572182698, now seen corresponding path program 1 times [2025-03-17 02:35:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:35:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970534028] [2025-03-17 02:35:28,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:28,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:35:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:35:28,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:35:28,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 02:35:28,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 02:35:28,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 02:35:28,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:28,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:28,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 02:35:28,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:35:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:35:28,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:35:28,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:35:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970534028] [2025-03-17 02:35:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970534028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:35:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:35:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:35:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451489809] [2025-03-17 02:35:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:35:28,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:35:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:35:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:35:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:35:28,456 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:35:28,733 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2025-03-17 02:35:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:35:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-03-17 02:35:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:35:28,743 INFO L225 Difference]: With dead ends: 108 [2025-03-17 02:35:28,744 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 02:35:28,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:35:28,744 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:35:28,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 97 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:35:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 02:35:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 02:35:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:35:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2025-03-17 02:35:28,762 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 71 [2025-03-17 02:35:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:35:28,762 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2025-03-17 02:35:28,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:35:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2025-03-17 02:35:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 02:35:28,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:35:28,763 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:35:28,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 02:35:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:35:28,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:35:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:35:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash -689021871, now seen corresponding path program 1 times [2025-03-17 02:35:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:35:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141731848] [2025-03-17 02:35:28,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:28,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:35:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:35:28,967 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:35:28,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 02:35:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 02:35:29,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 02:35:29,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:29,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:29,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 02:35:29,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:35:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 109 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 02:35:29,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:35:31,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:35:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141731848] [2025-03-17 02:35:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141731848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:35:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512255927] [2025-03-17 02:35:31,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:35:31,454 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 02:35:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 02:35:31,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 02:35:31,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-17 02:35:31,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 02:35:31,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 02:35:31,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:35:31,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:35:31,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 02:35:31,918 INFO L279 TraceCheckSpWp]: Computing forward predicates...