./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.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 ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:22:43,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:22:43,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:22:43,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:22:43,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:22:43,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:22:43,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:22:43,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:22:43,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:22:43,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:22:43,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:22:43,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:22:43,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:22:43,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:22:43,308 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:22:43,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:22:43,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:22:43,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:22:43,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:22:43,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:22:43,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:22:43,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:22:43,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:22:43,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:22:43,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:22:43,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:22:43,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:22:43,311 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 -> ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e [2025-03-17 00:22:43,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:22:43,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:22:43,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:22:43,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:22:43,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:22:43,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-17 00:22:44,771 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10c8d80c/a0e8c42740d6475a925124131f0b4657/FLAG03456fc6e [2025-03-17 00:22:44,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:22:44,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-17 00:22:44,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10c8d80c/a0e8c42740d6475a925124131f0b4657/FLAG03456fc6e [2025-03-17 00:22:45,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10c8d80c/a0e8c42740d6475a925124131f0b4657 [2025-03-17 00:22:45,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:22:45,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:22:45,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:22:45,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:22:45,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:22:45,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215011bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45, skipping insertion in model container [2025-03-17 00:22:45,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:22:45,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-17 00:22:45,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:22:45,494 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:22:45,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-17 00:22:45,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:22:45,542 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:22:45,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45 WrapperNode [2025-03-17 00:22:45,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:22:45,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:22:45,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:22:45,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:22:45,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,579 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2025-03-17 00:22:45,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:22:45,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:22:45,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:22:45,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:22:45,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,599 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:22:45,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:22:45,616 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:22:45,616 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:22:45,616 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:22:45,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (1/1) ... [2025-03-17 00:22:45,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:22:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:22:45,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:22:45,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:22:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:22:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:22:45,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:22:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:22:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:22:45,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:22:45,718 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:22:45,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:22:45,967 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 00:22:45,967 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:22:45,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:22:45,978 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:22:45,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:22:45 BoogieIcfgContainer [2025-03-17 00:22:45,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:22:45,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:22:45,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:22:45,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:22:45,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:22:45" (1/3) ... [2025-03-17 00:22:45,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dae72f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:22:45, skipping insertion in model container [2025-03-17 00:22:45,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:45" (2/3) ... [2025-03-17 00:22:45,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dae72f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:22:45, skipping insertion in model container [2025-03-17 00:22:45,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:22:45" (3/3) ... [2025-03-17 00:22:45,986 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-17 00:22:45,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:22:45,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:22:46,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:22:46,050 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;@e6d4bd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:22:46,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:22:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 00:22:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:22:46,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:46,065 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:46,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:46,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 486318658, now seen corresponding path program 1 times [2025-03-17 00:22:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240008909] [2025-03-17 00:22:46,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:46,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:22:46,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:22:46,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:46,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 00:22:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240008909] [2025-03-17 00:22:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240008909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:22:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702197502] [2025-03-17 00:22:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:46,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:22:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:22:46,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:22:46,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:22:46,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:22:46,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:22:46,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:46,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:46,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:22:46,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:22:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 00:22:46,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:22:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702197502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:46,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:22:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:22:46,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679106207] [2025-03-17 00:22:46,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:46,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:22:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:46,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:22:46,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:22:46,484 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:22:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:46,518 INFO L93 Difference]: Finished difference Result 137 states and 248 transitions. [2025-03-17 00:22:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:22:46,520 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-03-17 00:22:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:46,526 INFO L225 Difference]: With dead ends: 137 [2025-03-17 00:22:46,526 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 00:22:46,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:22:46,533 INFO L435 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:46,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:22:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 00:22:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 00:22:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 00:22:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 110 transitions. [2025-03-17 00:22:46,564 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 110 transitions. Word has length 139 [2025-03-17 00:22:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:46,564 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 110 transitions. [2025-03-17 00:22:46,564 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:22:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 110 transitions. [2025-03-17 00:22:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:22:46,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:46,567 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:46,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:22:46,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:22:46,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1720979678, now seen corresponding path program 1 times [2025-03-17 00:22:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:46,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579811767] [2025-03-17 00:22:46,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:46,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:22:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:22:46,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:46,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:22:46,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579811767] [2025-03-17 00:22:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579811767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:22:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44336625] [2025-03-17 00:22:46,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:46,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:22:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:22:46,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:22:46,975 INFO L87 Difference]: Start difference. First operand 68 states and 110 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:47,009 INFO L93 Difference]: Finished difference Result 189 states and 305 transitions. [2025-03-17 00:22:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:22:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2025-03-17 00:22:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:47,013 INFO L225 Difference]: With dead ends: 189 [2025-03-17 00:22:47,013 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 00:22:47,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-17 00:22:47,014 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 82 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:47,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 246 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:22:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 00:22:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-03-17 00:22:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 states have internal predecessors, (116), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 00:22:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 192 transitions. [2025-03-17 00:22:47,040 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 192 transitions. Word has length 139 [2025-03-17 00:22:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:47,041 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 192 transitions. [2025-03-17 00:22:47,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2025-03-17 00:22:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:22:47,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:47,044 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:22:47,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:47,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1071807955, now seen corresponding path program 1 times [2025-03-17 00:22:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:47,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183245913] [2025-03-17 00:22:47,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:47,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:47,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:22:47,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:22:47,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:22:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183245913] [2025-03-17 00:22:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183245913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:22:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101477187] [2025-03-17 00:22:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:47,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:22:47,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:47,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:22:47,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:22:47,340 INFO L87 Difference]: Start difference. First operand 119 states and 192 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:47,388 INFO L93 Difference]: Finished difference Result 353 states and 570 transitions. [2025-03-17 00:22:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:22:47,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2025-03-17 00:22:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:47,392 INFO L225 Difference]: With dead ends: 353 [2025-03-17 00:22:47,392 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 00:22:47,393 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-17 00:22:47,394 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:47,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 205 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:22:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 00:22:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2025-03-17 00:22:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 148 states have (on average 1.4324324324324325) internal successors, (212), 150 states have internal predecessors, (212), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 00:22:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 364 transitions. [2025-03-17 00:22:47,419 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 364 transitions. Word has length 140 [2025-03-17 00:22:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:47,420 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 364 transitions. [2025-03-17 00:22:47,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 364 transitions. [2025-03-17 00:22:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:22:47,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:47,421 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:47,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:22:47,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:47,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1070795061, now seen corresponding path program 1 times [2025-03-17 00:22:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:47,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313627006] [2025-03-17 00:22:47,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:47,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:22:47,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:22:47,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:47,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:22:47,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:22:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313627006] [2025-03-17 00:22:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313627006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:47,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:22:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873909858] [2025-03-17 00:22:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:47,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:22:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:22:47,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:22:47,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:22:47,839 INFO L87 Difference]: Start difference. First operand 229 states and 364 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:22:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:48,051 INFO L93 Difference]: Finished difference Result 811 states and 1277 transitions. [2025-03-17 00:22:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:22:48,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2025-03-17 00:22:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:48,055 INFO L225 Difference]: With dead ends: 811 [2025-03-17 00:22:48,055 INFO L226 Difference]: Without dead ends: 583 [2025-03-17 00:22:48,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:22:48,057 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 348 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:48,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 241 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:22:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-17 00:22:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 405. [2025-03-17 00:22:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 272 states have (on average 1.4485294117647058) internal successors, (394), 278 states have internal predecessors, (394), 124 states have call successors, (124), 8 states have call predecessors, (124), 8 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-17 00:22:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 642 transitions. [2025-03-17 00:22:48,125 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 642 transitions. Word has length 140 [2025-03-17 00:22:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 642 transitions. [2025-03-17 00:22:48,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:22:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 642 transitions. [2025-03-17 00:22:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:22:48,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:48,131 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:48,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:22:48,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:48,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:48,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1576353686, now seen corresponding path program 1 times [2025-03-17 00:22:48,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:22:48,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970244166] [2025-03-17 00:22:48,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:22:48,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:22:48,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:22:48,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:48,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:22:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155426016] [2025-03-17 00:22:48,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:48,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:22:48,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:22:48,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:22:48,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:22:48,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:22:48,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:22:48,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:48,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:22:48,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 00:22:48,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:22:48,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:22:48,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:48,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:22:48,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 00:22:48,415 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 00:22:48,416 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 00:22:48,424 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-17 00:22:48,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:22:48,620 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 00:22:48,704 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 00:22:48,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:22:48 BoogieIcfgContainer [2025-03-17 00:22:48,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 00:22:48,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 00:22:48,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 00:22:48,708 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 00:22:48,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:22:45" (3/4) ... [2025-03-17 00:22:48,711 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 00:22:48,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 00:22:48,713 INFO L158 Benchmark]: Toolchain (without parser) took 3374.82ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 124.0MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:22:48,713 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 192.9MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:22:48,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.24ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 106.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 00:22:48,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.73ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 103.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:22:48,714 INFO L158 Benchmark]: Boogie Preprocessor took 34.85ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 98.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 00:22:48,715 INFO L158 Benchmark]: IcfgBuilder took 362.68ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 74.6MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 00:22:48,715 INFO L158 Benchmark]: TraceAbstraction took 2727.24ms. Allocated memory is still 167.8MB. Free memory was 74.2MB in the beginning and 124.0MB in the end (delta: -49.8MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2025-03-17 00:22:48,715 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 124.0MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:22:48,716 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.22ms. Allocated memory is still 192.9MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.24ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 106.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.73ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 103.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.85ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 98.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 362.68ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 74.6MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2727.24ms. Allocated memory is still 167.8MB. Free memory was 74.2MB in the beginning and 124.0MB in the end (delta: -49.8MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 124.0MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 172. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] unsigned char var_1_20 = 8; [L36] signed char var_1_21 = 16; [L37] signed char var_1_22 = -64; [L38] signed char var_1_23 = -64; [L39] unsigned char var_1_24 = 0; [L40] signed short int var_1_25 = -5; [L41] unsigned char var_1_26 = 100; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] signed long int last_1_var_1_1 = 32; [L46] unsigned char last_1_var_1_12 = 32; [L47] signed short int last_1_var_1_18 = -64; [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L167] last_1_var_1_1 = var_1_1 [L168] last_1_var_1_12 = var_1_12 [L169] last_1_var_1_18 = var_1_18 [L179] RET updateLastVariables() [L180] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L133] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L134] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L134] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L135] var_1_9 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L136] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L137] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L137] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L138] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L138] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L139] var_1_10 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L141] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L141] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L142] var_1_13 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L143] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L144] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L144] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L147] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L147] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L148] var_1_17 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L149] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L152] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L152] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L153] var_1_22 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_22 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L154] RET assume_abort_if_not(var_1_22 >= -126) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L155] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L155] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L156] var_1_24 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L157] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L158] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L158] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L159] var_1_28 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L160] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L161] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L161] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L162] var_1_29 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L163] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L164] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L164] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L180] RET updateVariables() [L181] CALL step() [L51] var_1_19 = var_1_20 [L52] var_1_21 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L53] COND TRUE var_1_22 <= var_1_21 [L54] var_1_23 = ((((var_1_22) < (64)) ? (var_1_22) : (64))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L64] COND TRUE ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) > var_1_21 [L65] var_1_25 = var_1_21 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L67] COND TRUE \read(var_1_24) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L68] COND FALSE !(var_1_20 <= var_1_23) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L72] COND FALSE !(! (var_1_24 && var_1_28)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L77] signed long int stepLocal_1 = last_1_var_1_18; [L78] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L79] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L86] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L88] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L89] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L100] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L101] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L112] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L117] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L124] COND FALSE !(\read(var_1_14)) [L127] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 136 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 802 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 342 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 460 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 977 NumberOfCodeBlocks, 977 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 4578/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 00:22:48,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.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 ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:22:50,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:22:50,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:22:50,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:22:50,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:22:50,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:22:50,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:22:50,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:22:50,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:22:50,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:22:50,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:22:50,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:22:50,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:22:50,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:22:50,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:22:50,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:22:50,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:22:50,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:22:50,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:22:50,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:22:50,697 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 -> ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e [2025-03-17 00:22:50,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:22:50,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:22:50,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:22:50,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:22:50,970 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:22:50,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-17 00:22:52,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd898e397/0bf40db9fbe24e0990c2fe70380a33df/FLAG6f95fbe42 [2025-03-17 00:22:52,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:22:52,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-17 00:22:52,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd898e397/0bf40db9fbe24e0990c2fe70380a33df/FLAG6f95fbe42 [2025-03-17 00:22:52,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd898e397/0bf40db9fbe24e0990c2fe70380a33df [2025-03-17 00:22:52,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:22:52,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:22:52,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:22:52,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:22:52,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:22:52,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52, skipping insertion in model container [2025-03-17 00:22:52,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:22:52,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-17 00:22:52,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:22:52,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:22:52,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-17 00:22:52,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:22:52,594 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:22:52,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52 WrapperNode [2025-03-17 00:22:52,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:22:52,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:22:52,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:22:52,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:22:52,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,624 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-17 00:22:52,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:22:52,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:22:52,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:22:52,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:22:52,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,644 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:22:52,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:22:52,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:22:52,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:22:52,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:22:52,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (1/1) ... [2025-03-17 00:22:52,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:22:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:22:52,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:22:52,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:22:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:22:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:22:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:22:52,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:22:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:22:52,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:22:52,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:22:52,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:22:53,256 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 00:22:53,256 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:22:53,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:22:53,270 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:22:53,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:22:53 BoogieIcfgContainer [2025-03-17 00:22:53,270 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:22:53,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:22:53,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:22:53,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:22:53,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:22:52" (1/3) ... [2025-03-17 00:22:53,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192874bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:22:53, skipping insertion in model container [2025-03-17 00:22:53,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:22:52" (2/3) ... [2025-03-17 00:22:53,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192874bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:22:53, skipping insertion in model container [2025-03-17 00:22:53,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:22:53" (3/3) ... [2025-03-17 00:22:53,279 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-17 00:22:53,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:22:53,291 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:22:53,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:22:53,340 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;@59c489b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:22:53,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:22:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 00:22:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:22:53,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:53,355 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:53,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:53,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 486318658, now seen corresponding path program 1 times [2025-03-17 00:22:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:22:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145052727] [2025-03-17 00:22:53,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:22:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:22:53,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:22:53,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 00:22:53,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:22:53,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:22:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:53,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:53,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:22:53,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:22:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 00:22:53,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:22:53,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:22:53,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145052727] [2025-03-17 00:22:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145052727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:53,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:22:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053874907] [2025-03-17 00:22:53,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:53,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:22:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:22:53,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:22:53,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:22:53,658 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:22:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:53,682 INFO L93 Difference]: Finished difference Result 137 states and 248 transitions. [2025-03-17 00:22:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:22:53,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-03-17 00:22:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:53,691 INFO L225 Difference]: With dead ends: 137 [2025-03-17 00:22:53,692 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 00:22:53,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:22:53,698 INFO L435 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:53,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:22:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 00:22:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 00:22:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 00:22:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 110 transitions. [2025-03-17 00:22:53,736 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 110 transitions. Word has length 139 [2025-03-17 00:22:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:53,737 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 110 transitions. [2025-03-17 00:22:53,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:22:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 110 transitions. [2025-03-17 00:22:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:22:53,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:53,741 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:53,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 00:22:53,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:22:53,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:53,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1720979678, now seen corresponding path program 1 times [2025-03-17 00:22:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:22:53,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697981737] [2025-03-17 00:22:53,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:53,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:22:53,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:22:53,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:22:53,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 00:22:53,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:22:54,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:22:54,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:54,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:54,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:22:54,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:22:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:22:54,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:22:54,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:22:54,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697981737] [2025-03-17 00:22:54,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697981737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:54,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:54,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:22:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424432362] [2025-03-17 00:22:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:54,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:22:54,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:22:54,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:22:54,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:22:54,192 INFO L87 Difference]: Start difference. First operand 68 states and 110 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:54,233 INFO L93 Difference]: Finished difference Result 189 states and 305 transitions. [2025-03-17 00:22:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:22:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2025-03-17 00:22:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:54,235 INFO L225 Difference]: With dead ends: 189 [2025-03-17 00:22:54,235 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 00:22:54,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 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-17 00:22:54,236 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 82 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:54,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:22:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 00:22:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-03-17 00:22:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 states have internal predecessors, (116), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 00:22:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 192 transitions. [2025-03-17 00:22:54,249 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 192 transitions. Word has length 139 [2025-03-17 00:22:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:54,254 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 192 transitions. [2025-03-17 00:22:54,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2025-03-17 00:22:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:22:54,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:54,256 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:54,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 00:22:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:22:54,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1071807955, now seen corresponding path program 1 times [2025-03-17 00:22:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:22:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497697602] [2025-03-17 00:22:54,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:22:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:22:54,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:22:54,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 00:22:54,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:22:54,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:22:54,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:54,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:54,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:22:54,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:22:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:22:54,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:22:54,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:22:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497697602] [2025-03-17 00:22:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497697602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:22:54,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:22:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:22:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782906204] [2025-03-17 00:22:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:22:54,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:22:54,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:22:54,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:22:54,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:22:54,944 INFO L87 Difference]: Start difference. First operand 119 states and 192 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:22:55,086 INFO L93 Difference]: Finished difference Result 351 states and 566 transitions. [2025-03-17 00:22:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:22:55,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2025-03-17 00:22:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:22:55,090 INFO L225 Difference]: With dead ends: 351 [2025-03-17 00:22:55,090 INFO L226 Difference]: Without dead ends: 233 [2025-03-17 00:22:55,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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-17 00:22:55,091 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 30 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:22:55,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 204 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:22:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-17 00:22:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2025-03-17 00:22:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 148 states have internal predecessors, (208), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 00:22:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 360 transitions. [2025-03-17 00:22:55,120 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 360 transitions. Word has length 140 [2025-03-17 00:22:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:22:55,120 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 360 transitions. [2025-03-17 00:22:55,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:22:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 360 transitions. [2025-03-17 00:22:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:22:55,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:22:55,124 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:22:55,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 00:22:55,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:22:55,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:22:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:22:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1070795061, now seen corresponding path program 1 times [2025-03-17 00:22:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:22:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583944677] [2025-03-17 00:22:55,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:22:55,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:22:55,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:22:55,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:22:55,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 00:22:55,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:22:55,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:22:55,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:22:55,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:22:55,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 00:22:55,525 INFO L279 TraceCheckSpWp]: Computing forward predicates...