./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-72.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 570cb8a56cb70b864f784a54d3b070ab15ef6c47df19f08e3ec62e240bd62620 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:47:27,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:47:27,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:47:27,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:47:27,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:47:28,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:47:28,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:47:28,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:47:28,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:47:28,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:47:28,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:47:28,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:47:28,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:47:28,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:47:28,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:47:28,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:47:28,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:47:28,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:47:28,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:47:28,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:47:28,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:47:28,008 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 -> 570cb8a56cb70b864f784a54d3b070ab15ef6c47df19f08e3ec62e240bd62620 [2025-03-08 14:47:28,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:47:28,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:47:28,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:47:28,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:47:28,271 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:47:28,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-72.i [2025-03-08 14:47:29,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87c29768/32a32afad5784c9b92d2190455109a64/FLAGb4aa69bd9 [2025-03-08 14:47:29,662 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:47:29,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-72.i [2025-03-08 14:47:29,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87c29768/32a32afad5784c9b92d2190455109a64/FLAGb4aa69bd9 [2025-03-08 14:47:29,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87c29768/32a32afad5784c9b92d2190455109a64 [2025-03-08 14:47:29,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:47:29,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:47:29,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:47:29,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:47:29,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:47:29,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:47:29" (1/1) ... [2025-03-08 14:47:29,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ae536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:29, skipping insertion in model container [2025-03-08 14:47:29,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:47:29" (1/1) ... [2025-03-08 14:47:29,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:47:30,092 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_loopvsstraightlinecode_50-1loop_file-72.i[915,928] [2025-03-08 14:47:30,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:47:30,139 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:47:30,146 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_loopvsstraightlinecode_50-1loop_file-72.i[915,928] [2025-03-08 14:47:30,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:47:30,173 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:47:30,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30 WrapperNode [2025-03-08 14:47:30,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:47:30,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:47:30,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:47:30,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:47:30,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,201 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-08 14:47:30,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:47:30,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:47:30,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:47:30,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:47:30,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,227 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-08 14:47:30,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:47:30,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:47:30,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:47:30,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:47:30,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (1/1) ... [2025-03-08 14:47:30,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:47:30,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:47:30,267 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-08 14:47:30,269 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-08 14:47:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:47:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:47:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:47:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:47:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:47:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:47:30,351 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:47:30,352 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:47:30,555 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:47:30,556 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:47:30,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:47:30,564 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:47:30,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:47:30 BoogieIcfgContainer [2025-03-08 14:47:30,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:47:30,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:47:30,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:47:30,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:47:30,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:47:29" (1/3) ... [2025-03-08 14:47:30,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488df82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:47:30, skipping insertion in model container [2025-03-08 14:47:30,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:30" (2/3) ... [2025-03-08 14:47:30,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488df82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:47:30, skipping insertion in model container [2025-03-08 14:47:30,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:47:30" (3/3) ... [2025-03-08 14:47:30,571 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-72.i [2025-03-08 14:47:30,581 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:47:30,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-72.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:47:30,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:47:30,633 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;@5b1e2b87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:47:30,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:47:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:47:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 14:47:30,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:30,644 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:30,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:30,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1641484055, now seen corresponding path program 1 times [2025-03-08 14:47:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:30,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034905010] [2025-03-08 14:47:30,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:30,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 14:47:30,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 14:47:30,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:30,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:47:30,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:30,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034905010] [2025-03-08 14:47:30,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034905010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:47:30,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12920720] [2025-03-08 14:47:30,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:47:30,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:47:30,910 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-08 14:47:30,911 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-08 14:47:30,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 14:47:31,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 14:47:31,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:31,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:31,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:47:31,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:47:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:47:31,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:47:31,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12920720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:31,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:47:31,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:47:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078072954] [2025-03-08 14:47:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:31,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:47:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:31,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:47:31,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:47:31,077 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:47:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:31,092 INFO L93 Difference]: Finished difference Result 111 states and 182 transitions. [2025-03-08 14:47:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:47:31,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2025-03-08 14:47:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:31,099 INFO L225 Difference]: With dead ends: 111 [2025-03-08 14:47:31,099 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 14:47:31,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-08 14:47:31,104 INFO L435 NwaCegarLoop]: 82 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, 82 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-08 14:47:31,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:47:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 14:47:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 14:47:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:47:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2025-03-08 14:47:31,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 112 [2025-03-08 14:47:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2025-03-08 14:47:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:47:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2025-03-08 14:47:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 14:47:31,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:31,137 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:31,145 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-08 14:47:31,341 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-08 14:47:31,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash -89066710, now seen corresponding path program 1 times [2025-03-08 14:47:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462204346] [2025-03-08 14:47:31,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:31,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 14:47:31,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 14:47:31,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:31,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462204346] [2025-03-08 14:47:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462204346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:47:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903725952] [2025-03-08 14:47:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:47:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:31,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:47:31,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:47:31,721 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:31,763 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2025-03-08 14:47:31,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:47:31,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2025-03-08 14:47:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:31,765 INFO L225 Difference]: With dead ends: 122 [2025-03-08 14:47:31,766 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 14:47:31,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:47:31,767 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:31,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 155 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:47:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 14:47:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2025-03-08 14:47:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:47:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-08 14:47:31,781 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 112 [2025-03-08 14:47:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:31,783 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-08 14:47:31,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-08 14:47:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:47:31,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:31,784 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:31,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:47:31,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:31,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1997721433, now seen corresponding path program 1 times [2025-03-08 14:47:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:31,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728990477] [2025-03-08 14:47:31,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:47:31,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:47:31,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:31,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:31,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:31,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728990477] [2025-03-08 14:47:31,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728990477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:31,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:31,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:47:31,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096349149] [2025-03-08 14:47:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:31,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:47:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:31,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:47:31,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:47:31,886 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:47:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:32,024 INFO L93 Difference]: Finished difference Result 164 states and 243 transitions. [2025-03-08 14:47:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:47:32,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2025-03-08 14:47:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:32,027 INFO L225 Difference]: With dead ends: 164 [2025-03-08 14:47:32,027 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 14:47:32,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 14:47:32,029 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 121 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:32,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 134 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:47:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 14:47:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 58. [2025-03-08 14:47:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:47:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-08 14:47:32,042 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 113 [2025-03-08 14:47:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:32,043 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-08 14:47:32,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:47:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-08 14:47:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:47:32,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:32,045 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:32,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:47:32,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:32,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -963832261, now seen corresponding path program 1 times [2025-03-08 14:47:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514415942] [2025-03-08 14:47:32,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:32,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:47:32,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:47:32,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:32,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:32,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:32,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514415942] [2025-03-08 14:47:32,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514415942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:32,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:32,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:47:32,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230043770] [2025-03-08 14:47:32,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:32,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:47:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:32,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:47:32,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:47:32,400 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:32,494 INFO L93 Difference]: Finished difference Result 154 states and 220 transitions. [2025-03-08 14:47:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:47:32,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2025-03-08 14:47:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:32,497 INFO L225 Difference]: With dead ends: 154 [2025-03-08 14:47:32,497 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 14:47:32,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 14:47:32,498 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:32,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 162 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:47:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 14:47:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2025-03-08 14:47:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 14:47:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2025-03-08 14:47:32,517 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 113 [2025-03-08 14:47:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2025-03-08 14:47:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2025-03-08 14:47:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:47:32,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:32,521 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:32,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:47:32,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:32,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash 778978074, now seen corresponding path program 1 times [2025-03-08 14:47:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:32,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755102441] [2025-03-08 14:47:32,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:32,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:32,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:47:32,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:47:32,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:32,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 14:47:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755102441] [2025-03-08 14:47:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755102441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:47:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416582932] [2025-03-08 14:47:32,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:32,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:47:32,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:47:32,693 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-08 14:47:32,694 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-08 14:47:32,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:47:32,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:47:32,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:32,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:32,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:47:32,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:47:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-08 14:47:32,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:47:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 14:47:33,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416582932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:47:33,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:47:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 14:47:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350553532] [2025-03-08 14:47:33,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:47:33,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:47:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:33,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:47:33,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:47:33,091 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 14:47:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:33,256 INFO L93 Difference]: Finished difference Result 140 states and 197 transitions. [2025-03-08 14:47:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:47:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 113 [2025-03-08 14:47:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:33,258 INFO L225 Difference]: With dead ends: 140 [2025-03-08 14:47:33,258 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 14:47:33,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:47:33,259 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 60 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:33,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 161 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:47:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 14:47:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-03-08 14:47:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 14:47:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-03-08 14:47:33,268 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 113 [2025-03-08 14:47:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:33,268 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-03-08 14:47:33,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 14:47:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-03-08 14:47:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:47:33,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:33,270 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:33,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 14:47:33,474 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-08 14:47:33,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:33,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1160345766, now seen corresponding path program 1 times [2025-03-08 14:47:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699604986] [2025-03-08 14:47:33,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:33,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:47:33,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:47:33,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:47:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058114435] [2025-03-08 14:47:33,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:33,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:47:33,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:47:33,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:47:33,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:47:33,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:47:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:47:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:33,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:33,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 14:47:33,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:47:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:33,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:47:33,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:33,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699604986] [2025-03-08 14:47:33,934 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:47:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058114435] [2025-03-08 14:47:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058114435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:47:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716035988] [2025-03-08 14:47:33,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:33,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:47:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:33,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:47:33,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:47:33,936 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:34,036 INFO L93 Difference]: Finished difference Result 200 states and 274 transitions. [2025-03-08 14:47:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:47:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2025-03-08 14:47:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:34,038 INFO L225 Difference]: With dead ends: 200 [2025-03-08 14:47:34,038 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 14:47:34,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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-08 14:47:34,039 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 59 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:34,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 221 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:47:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 14:47:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2025-03-08 14:47:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 14:47:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2025-03-08 14:47:34,052 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 113 [2025-03-08 14:47:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:34,052 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2025-03-08 14:47:34,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2025-03-08 14:47:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 14:47:34,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:34,053 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:34,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:47:34,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:47:34,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:34,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -894422773, now seen corresponding path program 1 times [2025-03-08 14:47:34,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:34,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709316152] [2025-03-08 14:47:34,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 14:47:34,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 14:47:34,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:34,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709316152] [2025-03-08 14:47:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709316152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:34,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:47:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540897682] [2025-03-08 14:47:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:47:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:34,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:47:34,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:47:34,360 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:34,432 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2025-03-08 14:47:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:47:34,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2025-03-08 14:47:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:34,434 INFO L225 Difference]: With dead ends: 189 [2025-03-08 14:47:34,434 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 14:47:34,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 14:47:34,435 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:34,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 216 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:47:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 14:47:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 105. [2025-03-08 14:47:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 14:47:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2025-03-08 14:47:34,448 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 114 [2025-03-08 14:47:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:34,448 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2025-03-08 14:47:34,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2025-03-08 14:47:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 14:47:34,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:34,449 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:34,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 14:47:34,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:34,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:34,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1500719272, now seen corresponding path program 1 times [2025-03-08 14:47:34,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:34,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986246840] [2025-03-08 14:47:34,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:34,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 14:47:34,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 14:47:34,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:34,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:34,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:47:34,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986246840] [2025-03-08 14:47:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986246840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:47:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090340066] [2025-03-08 14:47:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:34,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:47:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:47:34,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:47:34,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:47:34,525 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:34,619 INFO L93 Difference]: Finished difference Result 227 states and 309 transitions. [2025-03-08 14:47:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:47:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2025-03-08 14:47:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:34,621 INFO L225 Difference]: With dead ends: 227 [2025-03-08 14:47:34,621 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 14:47:34,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 14:47:34,622 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 108 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:34,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 130 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:47:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 14:47:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 101. [2025-03-08 14:47:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 14:47:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 137 transitions. [2025-03-08 14:47:34,642 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 137 transitions. Word has length 114 [2025-03-08 14:47:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:34,643 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 137 transitions. [2025-03-08 14:47:34,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2025-03-08 14:47:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 14:47:34,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:34,644 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 14:47:34,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:34,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1368295932, now seen corresponding path program 1 times [2025-03-08 14:47:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:47:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086346514] [2025-03-08 14:47:34,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:47:34,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 14:47:34,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 14:47:34,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:34,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:47:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258714751] [2025-03-08 14:47:34,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:34,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:47:34,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:47:34,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:47:34,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:47:34,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 14:47:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 14:47:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:47:34,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:47:34,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 14:47:34,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 14:47:34,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:34,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:47:34,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:47:34,962 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:47:34,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:47:34,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 14:47:35,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:47:35,170 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:35,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:47:35,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:47:35 BoogieIcfgContainer [2025-03-08 14:47:35,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:47:35,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:47:35,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:47:35,242 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:47:35,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:47:30" (3/4) ... [2025-03-08 14:47:35,244 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:47:35,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:47:35,246 INFO L158 Benchmark]: Toolchain (without parser) took 5270.47ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 51.5MB in the end (delta: 80.9MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2025-03-08 14:47:35,246 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:47:35,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.06ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 118.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:47:35,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 116.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:47:35,247 INFO L158 Benchmark]: Boogie Preprocessor took 37.38ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 113.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:47:35,247 INFO L158 Benchmark]: IcfgBuilder took 325.17ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 94.5MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:47:35,248 INFO L158 Benchmark]: TraceAbstraction took 4675.29ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 51.5MB in the end (delta: 42.0MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2025-03-08 14:47:35,248 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:47:35,249 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.06ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 118.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 116.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.38ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 113.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 325.17ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 94.5MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4675.29ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 51.5MB in the end (delta: 42.0MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 50.8kB). 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 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned char last_1_var_1_17 = 1; [L41] double last_1_var_1_20 = 9.25; [L42] unsigned char last_1_var_1_23 = 2; [L43] unsigned short int last_1_var_1_26 = 5; [L44] signed long int last_1_var_1_29 = 128; VAL [isInitial=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L131] isInitial = 1 [L132] FCALL initially() [L133] int k_loop; [L134] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L134] COND TRUE k_loop < 1 [L135] CALL updateLastVariables() [L120] last_1_var_1_17 = var_1_17 [L121] last_1_var_1_20 = var_1_20 [L122] last_1_var_1_23 = var_1_23 [L123] last_1_var_1_26 = var_1_26 [L124] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L135] RET updateLastVariables() [L136] CALL updateVariables() [L91] var_1_11 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L92] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L93] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L93] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L94] var_1_14 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L95] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L96] var_1_16 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L97] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L98] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L98] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L99] var_1_18 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L100] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L101] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L101] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L102] var_1_19 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L103] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L104] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L104] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L105] var_1_21 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L106] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L107] var_1_22 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L108] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L109] var_1_25 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L110] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L111] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L111] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L112] var_1_27 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L113] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L114] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L114] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L115] var_1_28 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L116] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L117] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L117] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L136] RET updateVariables() [L137] CALL step() [L48] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L51] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L52] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L53] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L61] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L62] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L64] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L65] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L68] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L69] COND TRUE var_1_17 && (var_1_25 >= (var_1_27 - var_1_28)) [L70] var_1_26 = 16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L77] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L78] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L85] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1] [L87] var_1_31 = var_1_26 [L88] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16] [L137] RET step() [L138] CALL, EXPR property() [L127-L128] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; VAL [\result=0, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16] [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 9, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 506 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 1261 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 633 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 628 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 209 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2694 SizeOfPredicates, 2 NumberOfNonLiveVariables, 861 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 5853/5984 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-08 14:47:35,265 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_loopvsstraightlinecode_50-1loop_file-72.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 570cb8a56cb70b864f784a54d3b070ab15ef6c47df19f08e3ec62e240bd62620 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:47:37,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:47:37,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:47:37,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:47:37,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:47:37,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:47:37,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:47:37,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:47:37,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:47:37,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:47:37,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:47:37,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:47:37,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:47:37,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:47:37,303 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:47:37,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:47:37,304 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:47:37,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:47:37,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:47:37,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:47:37,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:47:37,306 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 -> 570cb8a56cb70b864f784a54d3b070ab15ef6c47df19f08e3ec62e240bd62620 [2025-03-08 14:47:37,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:47:37,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:47:37,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:47:37,546 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:47:37,546 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:47:37,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-72.i [2025-03-08 14:47:38,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21880abfc/5e0ec6fd1fcd4afba31be468b9a64b67/FLAG0c2c24382 [2025-03-08 14:47:38,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:47:38,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-72.i [2025-03-08 14:47:38,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21880abfc/5e0ec6fd1fcd4afba31be468b9a64b67/FLAG0c2c24382 [2025-03-08 14:47:39,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21880abfc/5e0ec6fd1fcd4afba31be468b9a64b67 [2025-03-08 14:47:39,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:47:39,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:47:39,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:47:39,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:47:39,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:47:39,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b15e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39, skipping insertion in model container [2025-03-08 14:47:39,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:47:39,443 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_loopvsstraightlinecode_50-1loop_file-72.i[915,928] [2025-03-08 14:47:39,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:47:39,521 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:47:39,532 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_loopvsstraightlinecode_50-1loop_file-72.i[915,928] [2025-03-08 14:47:39,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:47:39,581 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:47:39,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39 WrapperNode [2025-03-08 14:47:39,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:47:39,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:47:39,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:47:39,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:47:39,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,626 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-08 14:47:39,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:47:39,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:47:39,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:47:39,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:47:39,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,653 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-08 14:47:39,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:47:39,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:47:39,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:47:39,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:47:39,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (1/1) ... [2025-03-08 14:47:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:47:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:47:39,699 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-08 14:47:39,704 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-08 14:47:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:47:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:47:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:47:39,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:47:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:47:39,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:47:39,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:47:39,797 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:47:48,545 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:47:48,545 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:47:48,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:47:48,554 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:47:48,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:47:48 BoogieIcfgContainer [2025-03-08 14:47:48,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:47:48,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:47:48,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:47:48,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:47:48,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:47:39" (1/3) ... [2025-03-08 14:47:48,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d17ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:47:48, skipping insertion in model container [2025-03-08 14:47:48,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:47:39" (2/3) ... [2025-03-08 14:47:48,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d17ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:47:48, skipping insertion in model container [2025-03-08 14:47:48,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:47:48" (3/3) ... [2025-03-08 14:47:48,562 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-72.i [2025-03-08 14:47:48,573 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:47:48,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-72.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:47:48,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:47:48,630 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;@13174357, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:47:48,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:47:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:47:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 14:47:48,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:48,645 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:48,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:48,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1641484055, now seen corresponding path program 1 times [2025-03-08 14:47:48,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:47:48,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579922760] [2025-03-08 14:47:48,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:48,665 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-08 14:47:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:47:48,670 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-08 14:47:48,673 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-08 14:47:48,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 14:47:49,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 14:47:49,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:49,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:49,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:47:49,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:47:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-08 14:47:49,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:47:49,133 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:47:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579922760] [2025-03-08 14:47:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579922760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:47:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107442529] [2025-03-08 14:47:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:49,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:47:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:47:49,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:47:49,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:47:49,160 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:47:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:49,176 INFO L93 Difference]: Finished difference Result 111 states and 182 transitions. [2025-03-08 14:47:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:47:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2025-03-08 14:47:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:49,182 INFO L225 Difference]: With dead ends: 111 [2025-03-08 14:47:49,182 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 14:47:49,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-08 14:47:49,186 INFO L435 NwaCegarLoop]: 81 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, 81 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-08 14:47:49,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:47:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 14:47:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 14:47:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:47:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-03-08 14:47:49,218 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 112 [2025-03-08 14:47:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:49,218 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-03-08 14:47:49,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:47:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-03-08 14:47:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:47:49,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:49,223 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:49,235 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-08 14:47:49,423 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-08 14:47:49,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:49,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash -963832261, now seen corresponding path program 1 times [2025-03-08 14:47:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:47:49,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974759632] [2025-03-08 14:47:49,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:49,425 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-08 14:47:49,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:47:49,427 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-08 14:47:49,428 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-08 14:47:49,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:47:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:47:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:49,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:49,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:47:49,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:47:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:52,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:47:52,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:47:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974759632] [2025-03-08 14:47:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974759632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:47:52,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718071738] [2025-03-08 14:47:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:52,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:47:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:47:52,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:47:52,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:47:52,147 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:53,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:47:58,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:47:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:47:58,070 INFO L93 Difference]: Finished difference Result 165 states and 241 transitions. [2025-03-08 14:47:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:47:58,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2025-03-08 14:47:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:47:58,113 INFO L225 Difference]: With dead ends: 165 [2025-03-08 14:47:58,113 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 14:47:58,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:47:58,114 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 59 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:47:58,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 221 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-03-08 14:47:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 14:47:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2025-03-08 14:47:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 14:47:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2025-03-08 14:47:58,129 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 113 [2025-03-08 14:47:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:47:58,130 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2025-03-08 14:47:58,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:47:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2025-03-08 14:47:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 14:47:58,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:47:58,132 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:47:58,145 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-08 14:47:58,332 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-08 14:47:58,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:47:58,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:47:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash -697909268, now seen corresponding path program 1 times [2025-03-08 14:47:58,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:47:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864179648] [2025-03-08 14:47:58,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:47:58,334 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-08 14:47:58,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:47:58,337 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-08 14:47:58,338 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-08 14:47:58,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 14:47:58,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 14:47:58,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:47:58,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:47:58,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 14:47:58,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:47:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:47:59,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:47:59,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:47:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864179648] [2025-03-08 14:47:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864179648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:47:59,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:47:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:47:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644625005] [2025-03-08 14:47:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:47:59,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:47:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:47:59,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:47:59,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:47:59,709 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:48:03,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:48:07,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:48:12,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:48:13,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:48:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:48:13,448 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2025-03-08 14:48:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:48:13,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2025-03-08 14:48:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:48:13,491 INFO L225 Difference]: With dead ends: 157 [2025-03-08 14:48:13,492 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 14:48:13,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:48:13,492 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 46 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2025-03-08 14:48:13,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 217 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 13.7s Time] [2025-03-08 14:48:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 14:48:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2025-03-08 14:48:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 14:48:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-03-08 14:48:13,504 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 114 [2025-03-08 14:48:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:48:13,504 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-03-08 14:48:13,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:48:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-03-08 14:48:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 14:48:13,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:48:13,507 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:48:13,527 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-08 14:48:13,707 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-08 14:48:13,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:48:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:48:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1564809437, now seen corresponding path program 1 times [2025-03-08 14:48:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:48:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910344933] [2025-03-08 14:48:13,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:48:13,709 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-08 14:48:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:48:13,711 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-08 14:48:13,711 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-08 14:48:13,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 14:48:14,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 14:48:14,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:48:14,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:48:14,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:48:14,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:48:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-08 14:48:14,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:48:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 14:48:15,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:48:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910344933] [2025-03-08 14:48:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910344933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:48:15,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:48:15,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 14:48:15,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22044741] [2025-03-08 14:48:15,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:48:15,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:48:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:48:15,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:48:15,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:48:15,845 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 14:48:20,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:48:24,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:48:28,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:48:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:48:28,985 INFO L93 Difference]: Finished difference Result 152 states and 214 transitions. [2025-03-08 14:48:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:48:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 115 [2025-03-08 14:48:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:48:28,987 INFO L225 Difference]: With dead ends: 152 [2025-03-08 14:48:28,987 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 14:48:28,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:48:28,988 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:48:28,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 158 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2025-03-08 14:48:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 14:48:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-08 14:48:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 14:48:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2025-03-08 14:48:29,003 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 115 [2025-03-08 14:48:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:48:29,004 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2025-03-08 14:48:29,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 14:48:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2025-03-08 14:48:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 14:48:29,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:48:29,005 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:48:29,018 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 (5)] Ended with exit code 0 [2025-03-08 14:48:29,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-08 14:48:29,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:48:29,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:48:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1368295932, now seen corresponding path program 1 times [2025-03-08 14:48:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:48:29,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875526999] [2025-03-08 14:48:29,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:48:29,206 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-08 14:48:29,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:48:29,208 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 14:48:29,209 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 (6)] Waiting until timeout for monitored process [2025-03-08 14:48:29,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 14:48:29,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 14:48:29,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:48:29,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:48:29,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 14:48:29,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:48:57,295 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)