./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-10_file-3.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 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:34:12,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:34:12,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:34:12,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:34:12,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:34:12,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:34:12,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:34:12,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:34:12,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:34:12,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:34:12,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:34:12,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:34:12,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:34:12,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:34:12,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:34:12,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:34:12,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:12,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:34:12,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:34:12,271 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 -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c [2025-03-03 19:34:12,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:34:12,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:34:12,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:34:12,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:34:12,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:34:12,533 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-10_file-3.i [2025-03-03 19:34:13,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8f4d469/a26e62a3242440078f2e8aaf5bf43f98/FLAGf64c64a0f [2025-03-03 19:34:14,238 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:34:14,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2025-03-03 19:34:14,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8f4d469/a26e62a3242440078f2e8aaf5bf43f98/FLAGf64c64a0f [2025-03-03 19:34:15,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8f4d469/a26e62a3242440078f2e8aaf5bf43f98 [2025-03-03 19:34:15,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:34:15,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:34:15,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:15,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:34:15,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:34:15,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443e8196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15, skipping insertion in model container [2025-03-03 19:34:15,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:34:15,450 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-10_file-3.i[914,927] [2025-03-03 19:34:15,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:15,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:34:15,547 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-10_file-3.i[914,927] [2025-03-03 19:34:15,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:15,597 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:34:15,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15 WrapperNode [2025-03-03 19:34:15,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:15,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:15,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:34:15,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:34:15,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,643 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-03-03 19:34:15,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:15,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:34:15,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:34:15,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:34:15,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,670 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-03 19:34:15,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:34:15,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:34:15,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:34:15,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:34:15,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (1/1) ... [2025-03-03 19:34:15,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:15,721 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-03 19:34:15,725 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-03 19:34:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:34:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:34:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:34:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:34:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:34:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:34:15,812 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:34:15,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:34:16,093 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2025-03-03 19:34:16,120 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 19:34:16,120 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:34:16,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:34:16,135 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:34:16,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:16 BoogieIcfgContainer [2025-03-03 19:34:16,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:34:16,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:34:16,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:34:16,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:34:16,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:34:15" (1/3) ... [2025-03-03 19:34:16,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62299870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:16, skipping insertion in model container [2025-03-03 19:34:16,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:15" (2/3) ... [2025-03-03 19:34:16,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62299870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:16, skipping insertion in model container [2025-03-03 19:34:16,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:16" (3/3) ... [2025-03-03 19:34:16,146 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2025-03-03 19:34:16,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:34:16,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:34:16,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:34:16,237 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;@7624a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:34:16,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:34:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:34:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:34:16,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:16,252 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:16,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2060077928, now seen corresponding path program 1 times [2025-03-03 19:34:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150683909] [2025-03-03 19:34:16,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:16,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:34:16,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:34:16,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:16,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 19:34:16,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150683909] [2025-03-03 19:34:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150683909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795018330] [2025-03-03 19:34:16,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:16,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:16,547 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-03 19:34:16,548 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-03 19:34:16,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:34:16,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:34:16,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:16,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:16,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:34:16,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 19:34:16,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795018330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:34:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:34:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158390364] [2025-03-03 19:34:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:16,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:34:16,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:16,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:34:16,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:16,737 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:16,770 INFO L93 Difference]: Finished difference Result 172 states and 299 transitions. [2025-03-03 19:34:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:34:16,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-03-03 19:34:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:16,777 INFO L225 Difference]: With dead ends: 172 [2025-03-03 19:34:16,778 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 19:34:16,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-03 19:34:16,782 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:16,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 19:34:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-03 19:34:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:34:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2025-03-03 19:34:16,813 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 168 [2025-03-03 19:34:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:16,813 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2025-03-03 19:34:16,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2025-03-03 19:34:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:34:16,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:16,816 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:16,823 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-03 19:34:17,016 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-03 19:34:17,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:17,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash 80075926, now seen corresponding path program 1 times [2025-03-03 19:34:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397655505] [2025-03-03 19:34:17,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:34:17,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:34:17,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:17,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397655505] [2025-03-03 19:34:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397655505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:17,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:17,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:34:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547523772] [2025-03-03 19:34:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:17,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:17,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:17,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:17,419 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:17,492 INFO L93 Difference]: Finished difference Result 252 states and 393 transitions. [2025-03-03 19:34:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-03 19:34:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:17,498 INFO L225 Difference]: With dead ends: 252 [2025-03-03 19:34:17,498 INFO L226 Difference]: Without dead ends: 169 [2025-03-03 19:34:17,499 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-03 19:34:17,499 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 73 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:17,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 259 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-03 19:34:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-03-03 19:34:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.375) internal successors, (154), 112 states have internal predecessors, (154), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 19:34:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2025-03-03 19:34:17,534 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 168 [2025-03-03 19:34:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:17,535 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2025-03-03 19:34:17,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2025-03-03 19:34:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:34:17,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:17,538 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:17,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:34:17,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1325648171, now seen corresponding path program 1 times [2025-03-03 19:34:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:17,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760530406] [2025-03-03 19:34:17,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:17,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:34:17,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:34:17,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:17,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:17,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760530406] [2025-03-03 19:34:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760530406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:34:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880693347] [2025-03-03 19:34:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:17,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:17,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:17,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:17,665 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:17,723 INFO L93 Difference]: Finished difference Result 395 states and 608 transitions. [2025-03-03 19:34:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:17,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-03 19:34:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:17,725 INFO L225 Difference]: With dead ends: 395 [2025-03-03 19:34:17,726 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 19:34:17,729 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-03 19:34:17,729 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 43 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:17,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 276 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 19:34:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 185. [2025-03-03 19:34:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 19:34:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2025-03-03 19:34:17,757 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 169 [2025-03-03 19:34:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:17,758 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2025-03-03 19:34:17,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2025-03-03 19:34:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:34:17,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:17,760 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:17,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:34:17,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:17,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1471412778, now seen corresponding path program 1 times [2025-03-03 19:34:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53007937] [2025-03-03 19:34:17,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:17,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:34:17,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:34:17,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:17,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53007937] [2025-03-03 19:34:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53007937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:34:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370927113] [2025-03-03 19:34:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:17,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:17,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:17,889 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:17,966 INFO L93 Difference]: Finished difference Result 541 states and 836 transitions. [2025-03-03 19:34:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-03 19:34:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:17,969 INFO L225 Difference]: With dead ends: 541 [2025-03-03 19:34:17,970 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 19:34:17,970 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-03 19:34:17,973 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:17,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 348 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 19:34:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2025-03-03 19:34:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 248 states have (on average 1.3709677419354838) internal successors, (340), 248 states have internal predecessors, (340), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-03 19:34:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-03-03 19:34:18,034 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 169 [2025-03-03 19:34:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:18,035 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-03-03 19:34:18,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-03-03 19:34:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:34:18,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:18,038 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:18,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:34:18,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1562151642, now seen corresponding path program 1 times [2025-03-03 19:34:18,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:18,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404030999] [2025-03-03 19:34:18,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:18,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:34:18,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:34:18,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:18,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404030999] [2025-03-03 19:34:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404030999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:18,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:34:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686563220] [2025-03-03 19:34:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:18,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:34:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:18,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:34:18,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:34:18,407 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:18,952 INFO L93 Difference]: Finished difference Result 1075 states and 1655 transitions. [2025-03-03 19:34:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:34:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-03 19:34:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:18,959 INFO L225 Difference]: With dead ends: 1075 [2025-03-03 19:34:18,959 INFO L226 Difference]: Without dead ends: 897 [2025-03-03 19:34:18,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:34:18,960 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 316 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:18,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 532 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:34:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-03-03 19:34:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 885. [2025-03-03 19:34:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 614 states have (on average 1.3811074918566775) internal successors, (848), 614 states have internal predecessors, (848), 260 states have call successors, (260), 10 states have call predecessors, (260), 10 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-03 19:34:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1368 transitions. [2025-03-03 19:34:19,048 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1368 transitions. Word has length 170 [2025-03-03 19:34:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:19,049 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1368 transitions. [2025-03-03 19:34:19,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1368 transitions. [2025-03-03 19:34:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:34:19,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:19,051 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:19,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:34:19,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:19,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 814416698, now seen corresponding path program 1 times [2025-03-03 19:34:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:19,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315885286] [2025-03-03 19:34:19,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:19,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:34:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:34:19,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:19,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 72 proven. 72 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2025-03-03 19:34:20,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315885286] [2025-03-03 19:34:20,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315885286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733885657] [2025-03-03 19:34:20,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:20,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:20,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:20,726 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-03 19:34:20,727 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-03 19:34:20,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:34:20,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:34:20,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:20,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:20,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 19:34:20,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 838 proven. 153 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-03 19:34:22,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 111 proven. 171 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-03-03 19:34:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733885657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:34:23,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:34:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 36 [2025-03-03 19:34:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624815598] [2025-03-03 19:34:23,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:34:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 19:34:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 19:34:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 19:34:23,554 INFO L87 Difference]: Start difference. First operand 885 states and 1368 transitions. Second operand has 36 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 13 states have call successors, (70), 6 states have call predecessors, (70), 13 states have return successors, (70), 12 states have call predecessors, (70), 13 states have call successors, (70) [2025-03-03 19:34:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:25,198 INFO L93 Difference]: Finished difference Result 1891 states and 2786 transitions. [2025-03-03 19:34:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 19:34:25,199 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 13 states have call successors, (70), 6 states have call predecessors, (70), 13 states have return successors, (70), 12 states have call predecessors, (70), 13 states have call successors, (70) Word has length 170 [2025-03-03 19:34:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:25,206 INFO L225 Difference]: With dead ends: 1891 [2025-03-03 19:34:25,206 INFO L226 Difference]: Without dead ends: 1009 [2025-03-03 19:34:25,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1091, Invalid=2815, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 19:34:25,212 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1322 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:25,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 417 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:34:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-03 19:34:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 953. [2025-03-03 19:34:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 718 states have (on average 1.3342618384401115) internal successors, (958), 724 states have internal predecessors, (958), 192 states have call successors, (192), 42 states have call predecessors, (192), 42 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 19:34:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1342 transitions. [2025-03-03 19:34:25,279 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1342 transitions. Word has length 170 [2025-03-03 19:34:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:25,280 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1342 transitions. [2025-03-03 19:34:25,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 13 states have call successors, (70), 6 states have call predecessors, (70), 13 states have return successors, (70), 12 states have call predecessors, (70), 13 states have call successors, (70) [2025-03-03 19:34:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1342 transitions. [2025-03-03 19:34:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:34:25,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:25,282 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:25,289 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-03 19:34:25,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 19:34:25,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:25,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1815353976, now seen corresponding path program 1 times [2025-03-03 19:34:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:25,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125184086] [2025-03-03 19:34:25,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:25,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:34:25,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:34:25,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:25,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125184086] [2025-03-03 19:34:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125184086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:34:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785034553] [2025-03-03 19:34:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:25,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:34:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:25,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:34:25,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:34:25,694 INFO L87 Difference]: Start difference. First operand 953 states and 1342 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:25,960 INFO L93 Difference]: Finished difference Result 2083 states and 2950 transitions. [2025-03-03 19:34:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:34:25,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 19:34:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:25,972 INFO L225 Difference]: With dead ends: 2083 [2025-03-03 19:34:25,972 INFO L226 Difference]: Without dead ends: 1605 [2025-03-03 19:34:25,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:34:25,976 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 195 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:25,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 488 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:34:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-03 19:34:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1469. [2025-03-03 19:34:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1106 states have (on average 1.337251356238698) internal successors, (1479), 1112 states have internal predecessors, (1479), 296 states have call successors, (296), 66 states have call predecessors, (296), 66 states have return successors, (296), 290 states have call predecessors, (296), 296 states have call successors, (296) [2025-03-03 19:34:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2071 transitions. [2025-03-03 19:34:26,140 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2071 transitions. Word has length 171 [2025-03-03 19:34:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:26,141 INFO L471 AbstractCegarLoop]: Abstraction has 1469 states and 2071 transitions. [2025-03-03 19:34:26,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:34:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2071 transitions. [2025-03-03 19:34:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:34:26,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:26,144 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:26,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:34:26,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:26,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1592973699, now seen corresponding path program 1 times [2025-03-03 19:34:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365030325] [2025-03-03 19:34:26,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:34:26,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:34:26,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:26,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:26,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:26,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365030325] [2025-03-03 19:34:26,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365030325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:26,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:26,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 19:34:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285174136] [2025-03-03 19:34:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:26,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:34:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:26,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:34:26,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:34:26,398 INFO L87 Difference]: Start difference. First operand 1469 states and 2071 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:26,965 INFO L93 Difference]: Finished difference Result 2963 states and 4171 transitions. [2025-03-03 19:34:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:34:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-03-03 19:34:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:26,973 INFO L225 Difference]: With dead ends: 2963 [2025-03-03 19:34:26,973 INFO L226 Difference]: Without dead ends: 1497 [2025-03-03 19:34:26,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:34:26,977 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 329 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:26,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 574 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:34:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-03 19:34:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1477. [2025-03-03 19:34:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1114 states have (on average 1.3321364452423698) internal successors, (1484), 1120 states have internal predecessors, (1484), 296 states have call successors, (296), 66 states have call predecessors, (296), 66 states have return successors, (296), 290 states have call predecessors, (296), 296 states have call successors, (296) [2025-03-03 19:34:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2076 transitions. [2025-03-03 19:34:27,072 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2076 transitions. Word has length 171 [2025-03-03 19:34:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:27,073 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2076 transitions. [2025-03-03 19:34:27,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2076 transitions. [2025-03-03 19:34:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 19:34:27,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:27,074 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:34:27,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:27,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1096761699, now seen corresponding path program 1 times [2025-03-03 19:34:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784465732] [2025-03-03 19:34:27,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:27,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 19:34:27,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 19:34:27,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:27,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784465732] [2025-03-03 19:34:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784465732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:27,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:27,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:34:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964357230] [2025-03-03 19:34:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:27,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:34:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:27,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:34:27,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:34:27,372 INFO L87 Difference]: Start difference. First operand 1477 states and 2076 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:28,729 INFO L93 Difference]: Finished difference Result 2622 states and 3676 transitions. [2025-03-03 19:34:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:34:28,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2025-03-03 19:34:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:28,738 INFO L225 Difference]: With dead ends: 2622 [2025-03-03 19:34:28,738 INFO L226 Difference]: Without dead ends: 1839 [2025-03-03 19:34:28,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2025-03-03 19:34:28,741 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 374 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:28,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1274 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:34:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-03-03 19:34:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1682. [2025-03-03 19:34:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1273 states have (on average 1.328358208955224) internal successors, (1691), 1281 states have internal predecessors, (1691), 334 states have call successors, (334), 74 states have call predecessors, (334), 74 states have return successors, (334), 326 states have call predecessors, (334), 334 states have call successors, (334) [2025-03-03 19:34:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2359 transitions. [2025-03-03 19:34:28,885 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2359 transitions. Word has length 172 [2025-03-03 19:34:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:28,886 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2359 transitions. [2025-03-03 19:34:28,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2359 transitions. [2025-03-03 19:34:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 19:34:28,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:28,889 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:28,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:34:28,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:28,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1194180164, now seen corresponding path program 1 times [2025-03-03 19:34:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356159750] [2025-03-03 19:34:28,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:28,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 19:34:28,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 19:34:28,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:28,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:34:28,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614726341] [2025-03-03 19:34:28,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:28,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:28,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:28,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:34:28,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:34:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 19:34:29,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 19:34:29,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:34:29,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:34:29,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 19:34:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 19:34:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:34:29,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:34:29,193 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:34:29,194 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:34:29,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 19:34:29,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:29,398 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:29,486 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:34:29,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:34:29 BoogieIcfgContainer [2025-03-03 19:34:29,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:34:29,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:34:29,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:34:29,489 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:34:29,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:16" (3/4) ... [2025-03-03 19:34:29,492 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:34:29,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:34:29,493 INFO L158 Benchmark]: Toolchain (without parser) took 14182.84ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 96.0MB in the beginning and 210.7MB in the end (delta: -114.7MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2025-03-03 19:34:29,493 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:29,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.06ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 81.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:34:29,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 77.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:29,494 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 72.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:34:29,494 INFO L158 Benchmark]: IcfgBuilder took 449.14ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 46.2MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:34:29,494 INFO L158 Benchmark]: TraceAbstraction took 13349.03ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 45.7MB in the beginning and 210.8MB in the end (delta: -165.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-03-03 19:34:29,494 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 377.5MB. Free memory was 210.8MB in the beginning and 210.7MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:29,495 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.30ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.06ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 81.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 77.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 72.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 449.14ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 46.2MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13349.03ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 45.7MB in the beginning and 210.8MB in the end (delta: -165.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 377.5MB. Free memory was 210.8MB in the beginning and 210.7MB in the end (delta: 48.9kB). 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 bitwiseOr at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 158. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned long int var_1_25 = 4; [L39] unsigned short int var_1_26 = 2; [L40] unsigned short int var_1_27 = 100; [L41] signed char var_1_28 = 32; [L42] double var_1_29 = 16.25; [L43] double var_1_30 = 15.75; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 7.25; [L49] float var_1_36 = 1.75; [L50] signed long int var_1_37 = 0; [L51] unsigned long int last_1_var_1_10 = 256; [L52] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L154] last_1_var_1_10 = var_1_10 [L155] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L112] var_1_3 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L113] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L114] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L114] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L115] var_1_5 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L116] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L117] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L117] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L118] var_1_13 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L119] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L120] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L120] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L121] var_1_14 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L122] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L123] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L123] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L124] var_1_15 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L125] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L126] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L126] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L127] var_1_16 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L128] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L129] var_1_21 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L130] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L131] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L131] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L132] var_1_22 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L133] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L134] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L134] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L135] var_1_25 = __VERIFIER_nondet_ulong() [L136] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L136] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L137] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L137] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L138] var_1_27 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L139] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L140] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L140] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L141] var_1_30 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L142] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L143] var_1_32 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L144] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L145] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L146] var_1_33 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L147] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L148] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L149] var_1_34 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L150] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L151] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L151] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L166] RET updateVariables() [L167] CALL step() [L56] var_1_24 = var_1_25 [L57] var_1_26 = var_1_27 [L58] var_1_28 = -2 [L59] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L60] COND TRUE var_1_32 || var_1_33 [L61] var_1_31 = var_1_34 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L63] var_1_35 = var_1_30 [L64] var_1_36 = var_1_30 [L65] var_1_37 = var_1_27 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L66] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L71] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8001, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L72] COND TRUE stepLocal_2 > last_1_var_1_10 [L73] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L75] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L76] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L80] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L81] COND FALSE !(stepLocal_1 || var_1_3) [L86] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L88] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L99] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L104] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L104] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L105] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L158-L159] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=127, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=-63, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2769 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2769 mSDsluCounter, 4299 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2856 mSDsCounter, 1145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2370 IncrementalHoareTripleChecker+Invalid, 3515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1145 mSolverCounterUnsat, 1443 mSDtfsCounter, 2370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1682occurred in iteration=9, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 431 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2210 NumberOfCodeBlocks, 2210 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2024 ConstructedInterpolants, 0 QuantifiedInterpolants, 9905 SizeOfPredicates, 6 NumberOfNonLiveVariables, 804 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 15154/15600 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-03 19:34:29,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-10_file-3.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 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:34:31,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:34:31,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:34:31,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:34:31,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:34:31,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:34:31,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:34:31,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:34:31,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:34:31,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:34:31,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:34:31,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:34:31,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:34:31,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:34:31,603 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:34:31,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:34:31,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:34:31,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:34:31,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:34:31,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:34:31,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:34:31,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:34:31,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:34:31,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:31,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:34:31,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:34:31,606 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:34:31,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:31,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:34:31,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:34:31,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:34:31,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:34:31,606 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 -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c [2025-03-03 19:34:31,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:34:31,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:34:31,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:34:31,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:34:31,886 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:34:31,888 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-10_file-3.i [2025-03-03 19:34:33,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae4d1ff4/4a516c7ba2ac4c2bafc06c8148ae8118/FLAGe283a4ebd [2025-03-03 19:34:33,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:34:33,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2025-03-03 19:34:33,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae4d1ff4/4a516c7ba2ac4c2bafc06c8148ae8118/FLAGe283a4ebd [2025-03-03 19:34:33,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae4d1ff4/4a516c7ba2ac4c2bafc06c8148ae8118 [2025-03-03 19:34:33,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:34:33,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:34:33,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:33,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:34:33,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:34:33,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5873f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33, skipping insertion in model container [2025-03-03 19:34:33,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:34:33,757 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-10_file-3.i[914,927] [2025-03-03 19:34:33,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:33,825 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:34:33,833 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-10_file-3.i[914,927] [2025-03-03 19:34:33,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:33,871 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:34:33,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33 WrapperNode [2025-03-03 19:34:33,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:33,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:33,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:34:33,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:34:33,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,909 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-03 19:34:33,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:33,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:34:33,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:34:33,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:34:33,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,939 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-03 19:34:33,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:34:33,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:34:33,967 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:34:33,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:34:33,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (1/1) ... [2025-03-03 19:34:33,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:33,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:33,999 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-03 19:34:34,001 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-03 19:34:34,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:34:34,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:34:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:34:34,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:34:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:34:34,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:34:34,099 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:34:34,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:34:50,017 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:34:50,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:34:50,029 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:34:50,029 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:34:50,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:50 BoogieIcfgContainer [2025-03-03 19:34:50,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:34:50,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:34:50,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:34:50,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:34:50,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:34:33" (1/3) ... [2025-03-03 19:34:50,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a724b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:50, skipping insertion in model container [2025-03-03 19:34:50,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:33" (2/3) ... [2025-03-03 19:34:50,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a724b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:50, skipping insertion in model container [2025-03-03 19:34:50,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:50" (3/3) ... [2025-03-03 19:34:50,037 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2025-03-03 19:34:50,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:34:50,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:34:50,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:34:50,098 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;@7ca72778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:34:50,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:34:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:34:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 19:34:50,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:50,113 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:50,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:50,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1421757241, now seen corresponding path program 1 times [2025-03-03 19:34:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:50,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064341305] [2025-03-03 19:34:50,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:50,128 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-03 19:34:50,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:50,130 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-03 19:34:50,131 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-03 19:34:50,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 19:34:51,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 19:34:51,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:51,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:34:51,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-03 19:34:51,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:51,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064341305] [2025-03-03 19:34:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064341305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:34:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119961524] [2025-03-03 19:34:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:34:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:51,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:34:51,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:51,130 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:51,149 INFO L93 Difference]: Finished difference Result 150 states and 263 transitions. [2025-03-03 19:34:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:34:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2025-03-03 19:34:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:51,160 INFO L225 Difference]: With dead ends: 150 [2025-03-03 19:34:51,160 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 19:34:51,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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-03 19:34:51,164 INFO L435 NwaCegarLoop]: 115 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, 115 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-03 19:34:51,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 19:34:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 19:34:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:34:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2025-03-03 19:34:51,194 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 165 [2025-03-03 19:34:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:51,194 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2025-03-03 19:34:51,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:34:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2025-03-03 19:34:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 19:34:51,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:51,198 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:34:51,221 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-03 19:34:51,399 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-03 19:34:51,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:51,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -540230263, now seen corresponding path program 1 times [2025-03-03 19:34:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649490783] [2025-03-03 19:34:51,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:51,400 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-03 19:34:51,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:51,402 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-03 19:34:51,403 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-03 19:34:51,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 19:34:52,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 19:34:52,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:52,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:34:52,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:34:56,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:56,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:56,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649490783] [2025-03-03 19:34:56,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649490783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:56,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:56,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:34:56,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395109793] [2025-03-03 19:34:56,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:56,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:34:56,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:56,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:34:56,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:34:56,287 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:35:00,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:02,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:07,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:11,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:15,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:19,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:21,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:23,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:28,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:32,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:36,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:40,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:40,270 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2025-03-03 19:35:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:35:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2025-03-03 19:35:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:40,379 INFO L225 Difference]: With dead ends: 219 [2025-03-03 19:35:40,379 INFO L226 Difference]: Without dead ends: 147 [2025-03-03 19:35:40,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:35:40,380 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 31 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:40,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 352 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 9 Unknown, 0 Unchecked, 43.9s Time] [2025-03-03 19:35:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-03 19:35:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2025-03-03 19:35:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 19:35:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 223 transitions. [2025-03-03 19:35:40,404 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 223 transitions. Word has length 165 [2025-03-03 19:35:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:40,404 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 223 transitions. [2025-03-03 19:35:40,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:35:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 223 transitions. [2025-03-03 19:35:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 19:35:40,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:40,406 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:40,432 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 19:35:40,606 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-03 19:35:40,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1626254142, now seen corresponding path program 1 times [2025-03-03 19:35:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:35:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726982781] [2025-03-03 19:35:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:40,610 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-03 19:35:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:35:40,612 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-03 19:35:40,612 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-03 19:35:40,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 19:35:41,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 19:35:41,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:41,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:41,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:35:41,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:35:41,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:35:41,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:35:41,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726982781] [2025-03-03 19:35:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726982781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:41,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:41,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:35:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719109530] [2025-03-03 19:35:41,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:41,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:35:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:35:41,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:35:41,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:35:41,677 INFO L87 Difference]: Start difference. First operand 145 states and 223 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:35:46,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []