./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:54:30,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:54:31,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:54:31,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:54:31,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:54:31,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:54:31,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:54:31,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:54:31,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:54:31,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:54:31,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:54:31,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:54:31,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:54:31,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:54:31,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:54:31,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:54:31,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:54:31,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:54:31,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:54:31,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:54:31,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:54:31,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:54:31,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:54:31,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:54:31,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:54:31,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:54:31,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:54:31,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:54:31,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:54:31,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:54:31,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:54:31,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:54:31,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:54:31,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:54:31,037 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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2025-03-08 10:54:31,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:54:31,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:54:31,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:54:31,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:54:31,288 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:54:31,290 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-97.i [2025-03-08 10:54:32,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37fc326a1/11aadbb08f6941499f7b06a7e9596332/FLAGf9186c045 [2025-03-08 10:54:32,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:54:32,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-08 10:54:32,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37fc326a1/11aadbb08f6941499f7b06a7e9596332/FLAGf9186c045 [2025-03-08 10:54:32,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37fc326a1/11aadbb08f6941499f7b06a7e9596332 [2025-03-08 10:54:32,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:54:32,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:54:32,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:54:32,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:54:32,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:54:32,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:32" (1/1) ... [2025-03-08 10:54:32,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6512ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:32, skipping insertion in model container [2025-03-08 10:54:32,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:32" (1/1) ... [2025-03-08 10:54:32,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:54:32,990 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-97.i[915,928] [2025-03-08 10:54:33,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:54:33,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:54:33,080 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-97.i[915,928] [2025-03-08 10:54:33,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:54:33,134 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:54:33,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33 WrapperNode [2025-03-08 10:54:33,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:54:33,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:54:33,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:54:33,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:54:33,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,183 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 254 [2025-03-08 10:54:33,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:54:33,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:54:33,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:54:33,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:54:33,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,224 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:54:33,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:54:33,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:54:33,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:54:33,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:54:33,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (1/1) ... [2025-03-08 10:54:33,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:54:33,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:54:33,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:54:33,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:54:33,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:54:33,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:54:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:54:33,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:54:33,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:54:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:54:33,367 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:54:33,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:54:33,790 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1;havoc property_#t~ite28#1;havoc property_#t~bitwise27#1;havoc property_#t~short29#1; [2025-03-08 10:54:33,837 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-08 10:54:33,837 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:54:33,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:54:33,862 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:54:33,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:33 BoogieIcfgContainer [2025-03-08 10:54:33,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:54:33,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:54:33,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:54:33,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:54:33,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:54:32" (1/3) ... [2025-03-08 10:54:33,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea36e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:54:33, skipping insertion in model container [2025-03-08 10:54:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:33" (2/3) ... [2025-03-08 10:54:33,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea36e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:54:33, skipping insertion in model container [2025-03-08 10:54:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:33" (3/3) ... [2025-03-08 10:54:33,872 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-08 10:54:33,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:54:33,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:54:33,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:54:33,961 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;@b5c9907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:54:33,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:54:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 76 states have internal predecessors, (106), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:54:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 10:54:33,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:33,982 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:33,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:33,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash -676945052, now seen corresponding path program 1 times [2025-03-08 10:54:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:33,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082916405] [2025-03-08 10:54:33,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:34,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 10:54:34,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 10:54:34,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:34,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 10:54:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082916405] [2025-03-08 10:54:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082916405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:54:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946640756] [2025-03-08 10:54:34,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:34,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:54:34,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:54:34,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:54:34,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:54:34,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 10:54:34,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 10:54:34,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:34,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:34,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:54:34,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:54:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 10:54:34,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:54:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946640756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:34,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:54:34,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:54:34,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865906027] [2025-03-08 10:54:34,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:34,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:54:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:34,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:54:34,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:54:34,536 INFO L87 Difference]: Start difference. First operand has 107 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 76 states have internal predecessors, (106), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 10:54:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:34,578 INFO L93 Difference]: Finished difference Result 208 states and 352 transitions. [2025-03-08 10:54:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:54:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2025-03-08 10:54:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:34,589 INFO L225 Difference]: With dead ends: 208 [2025-03-08 10:54:34,589 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 10:54:34,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:54:34,595 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:34,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:54:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 10:54:34,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 10:54:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 73 states have internal predecessors, (101), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:54:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2025-03-08 10:54:34,636 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 185 [2025-03-08 10:54:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:34,637 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2025-03-08 10:54:34,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 10:54:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2025-03-08 10:54:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 10:54:34,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:34,642 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:34,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:54:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:54:34,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:34,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2018701407, now seen corresponding path program 1 times [2025-03-08 10:54:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652735014] [2025-03-08 10:54:34,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 10:54:34,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 10:54:34,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:34,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652735014] [2025-03-08 10:54:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652735014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:35,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:54:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484289569] [2025-03-08 10:54:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:35,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:54:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:35,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:54:35,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:54:35,096 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:35,181 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2025-03-08 10:54:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:54:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2025-03-08 10:54:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:35,189 INFO L225 Difference]: With dead ends: 292 [2025-03-08 10:54:35,189 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 10:54:35,190 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-08 10:54:35,191 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 144 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:35,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 389 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:54:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 10:54:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125. [2025-03-08 10:54:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:54:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2025-03-08 10:54:35,216 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 185 [2025-03-08 10:54:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:35,217 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2025-03-08 10:54:35,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2025-03-08 10:54:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 10:54:35,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:35,222 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:35,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:54:35,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:35,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:35,222 INFO L85 PathProgramCache]: Analyzing trace with hash -511149598, now seen corresponding path program 1 times [2025-03-08 10:54:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:35,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078222919] [2025-03-08 10:54:35,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:35,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 10:54:35,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 10:54:35,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:35,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078222919] [2025-03-08 10:54:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078222919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:54:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404921148] [2025-03-08 10:54:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:54:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:35,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:54:35,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:54:35,664 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:36,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:36,058 INFO L93 Difference]: Finished difference Result 422 states and 642 transitions. [2025-03-08 10:54:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:54:36,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2025-03-08 10:54:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:36,062 INFO L225 Difference]: With dead ends: 422 [2025-03-08 10:54:36,062 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 10:54:36,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:54:36,063 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 180 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:36,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 664 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:54:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 10:54:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 239. [2025-03-08 10:54:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 178 states have internal predecessors, (244), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 10:54:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 360 transitions. [2025-03-08 10:54:36,100 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 360 transitions. Word has length 185 [2025-03-08 10:54:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:36,100 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 360 transitions. [2025-03-08 10:54:36,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 360 transitions. [2025-03-08 10:54:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 10:54:36,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:36,102 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:54:36,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1587922542, now seen corresponding path program 1 times [2025-03-08 10:54:36,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914575003] [2025-03-08 10:54:36,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:36,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 10:54:36,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 10:54:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:36,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914575003] [2025-03-08 10:54:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914575003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:54:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554148858] [2025-03-08 10:54:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:54:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:54:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:54:36,549 INFO L87 Difference]: Start difference. First operand 239 states and 360 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:36,966 INFO L93 Difference]: Finished difference Result 623 states and 932 transitions. [2025-03-08 10:54:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:54:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2025-03-08 10:54:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:36,970 INFO L225 Difference]: With dead ends: 623 [2025-03-08 10:54:36,970 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 10:54:36,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:54:36,976 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 152 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:36,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 654 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:54:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 10:54:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 359. [2025-03-08 10:54:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 268 states have (on average 1.3507462686567164) internal successors, (362), 268 states have internal predecessors, (362), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 10:54:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 536 transitions. [2025-03-08 10:54:37,032 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 536 transitions. Word has length 186 [2025-03-08 10:54:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:37,033 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 536 transitions. [2025-03-08 10:54:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 536 transitions. [2025-03-08 10:54:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 10:54:37,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:37,036 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:37,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:54:37,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:37,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1469072480, now seen corresponding path program 1 times [2025-03-08 10:54:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453400408] [2025-03-08 10:54:37,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:37,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 10:54:37,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 10:54:37,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:37,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:37,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:37,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453400408] [2025-03-08 10:54:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453400408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:37,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:54:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656911801] [2025-03-08 10:54:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:37,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:54:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:37,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:54:37,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:54:37,219 INFO L87 Difference]: Start difference. First operand 359 states and 536 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:37,253 INFO L93 Difference]: Finished difference Result 716 states and 1071 transitions. [2025-03-08 10:54:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:54:37,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-08 10:54:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:37,256 INFO L225 Difference]: With dead ends: 716 [2025-03-08 10:54:37,256 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 10:54:37,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:54:37,258 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:37,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:54:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 10:54:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-08 10:54:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 269 states have (on average 1.342007434944238) internal successors, (361), 269 states have internal predecessors, (361), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 10:54:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 535 transitions. [2025-03-08 10:54:37,279 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 535 transitions. Word has length 187 [2025-03-08 10:54:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:37,280 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 535 transitions. [2025-03-08 10:54:37,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 535 transitions. [2025-03-08 10:54:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 10:54:37,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:37,282 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:37,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:54:37,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1762475487, now seen corresponding path program 1 times [2025-03-08 10:54:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:37,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395492167] [2025-03-08 10:54:37,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:37,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 10:54:37,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 10:54:37,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:37,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:37,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:37,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395492167] [2025-03-08 10:54:37,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395492167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:37,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:37,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:54:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900238462] [2025-03-08 10:54:37,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:37,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:54:37,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:37,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:54:37,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:54:37,500 INFO L87 Difference]: Start difference. First operand 360 states and 535 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:37,888 INFO L93 Difference]: Finished difference Result 644 states and 964 transitions. [2025-03-08 10:54:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:54:37,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-08 10:54:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:37,895 INFO L225 Difference]: With dead ends: 644 [2025-03-08 10:54:37,895 INFO L226 Difference]: Without dead ends: 521 [2025-03-08 10:54:37,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:54:37,896 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 255 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:37,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 920 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:54:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-08 10:54:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 367. [2025-03-08 10:54:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 276 states have (on average 1.3442028985507246) internal successors, (371), 276 states have internal predecessors, (371), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 10:54:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 545 transitions. [2025-03-08 10:54:37,946 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 545 transitions. Word has length 187 [2025-03-08 10:54:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:37,948 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 545 transitions. [2025-03-08 10:54:37,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 545 transitions. [2025-03-08 10:54:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 10:54:37,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:37,950 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:37,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:54:37,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:37,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1467951146, now seen corresponding path program 1 times [2025-03-08 10:54:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074733849] [2025-03-08 10:54:37,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:37,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 10:54:38,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 10:54:38,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:38,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074733849] [2025-03-08 10:54:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074733849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:38,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:54:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969229227] [2025-03-08 10:54:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:38,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:54:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:54:38,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:54:38,302 INFO L87 Difference]: Start difference. First operand 367 states and 545 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:38,395 INFO L93 Difference]: Finished difference Result 790 states and 1179 transitions. [2025-03-08 10:54:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:54:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-08 10:54:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:38,397 INFO L225 Difference]: With dead ends: 790 [2025-03-08 10:54:38,397 INFO L226 Difference]: Without dead ends: 426 [2025-03-08 10:54:38,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:54:38,399 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 132 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:38,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 584 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:54:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-08 10:54:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 367. [2025-03-08 10:54:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 276 states have (on average 1.315217391304348) internal successors, (363), 276 states have internal predecessors, (363), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 10:54:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 537 transitions. [2025-03-08 10:54:38,451 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 537 transitions. Word has length 187 [2025-03-08 10:54:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:38,451 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 537 transitions. [2025-03-08 10:54:38,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 537 transitions. [2025-03-08 10:54:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 10:54:38,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:38,453 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:38,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:54:38,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:38,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1221912835, now seen corresponding path program 1 times [2025-03-08 10:54:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:38,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097728854] [2025-03-08 10:54:38,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:38,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:38,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 10:54:38,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 10:54:38,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:38,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097728854] [2025-03-08 10:54:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097728854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:54:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008731645] [2025-03-08 10:54:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:38,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:54:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:38,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:54:38,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:54:38,648 INFO L87 Difference]: Start difference. First operand 367 states and 537 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:39,229 INFO L93 Difference]: Finished difference Result 1218 states and 1768 transitions. [2025-03-08 10:54:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:54:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-08 10:54:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:39,233 INFO L225 Difference]: With dead ends: 1218 [2025-03-08 10:54:39,234 INFO L226 Difference]: Without dead ends: 854 [2025-03-08 10:54:39,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:54:39,235 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 335 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:39,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 649 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:54:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-08 10:54:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 634. [2025-03-08 10:54:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 483 states have (on average 1.2939958592132506) internal successors, (625), 483 states have internal predecessors, (625), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-08 10:54:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 915 transitions. [2025-03-08 10:54:39,347 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 915 transitions. Word has length 191 [2025-03-08 10:54:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:39,347 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 915 transitions. [2025-03-08 10:54:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 915 transitions. [2025-03-08 10:54:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 10:54:39,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:39,349 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:39,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:54:39,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:39,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1659012699, now seen corresponding path program 1 times [2025-03-08 10:54:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:39,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331164930] [2025-03-08 10:54:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 10:54:39,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 10:54:39,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:39,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:54:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331164930] [2025-03-08 10:54:44,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331164930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:44,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:44,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:54:44,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960377138] [2025-03-08 10:54:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:44,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:54:44,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:54:44,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:54:44,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:54:44,205 INFO L87 Difference]: Start difference. First operand 634 states and 915 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:45,979 INFO L93 Difference]: Finished difference Result 1328 states and 1859 transitions. [2025-03-08 10:54:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:54:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-08 10:54:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:45,988 INFO L225 Difference]: With dead ends: 1328 [2025-03-08 10:54:45,988 INFO L226 Difference]: Without dead ends: 1084 [2025-03-08 10:54:45,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:54:45,990 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 136 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:45,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 586 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:54:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2025-03-08 10:54:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1009. [2025-03-08 10:54:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 843 states have (on average 1.298932384341637) internal successors, (1095), 848 states have internal predecessors, (1095), 155 states have call successors, (155), 10 states have call predecessors, (155), 10 states have return successors, (155), 150 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-08 10:54:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1405 transitions. [2025-03-08 10:54:46,090 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1405 transitions. Word has length 191 [2025-03-08 10:54:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:46,090 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1405 transitions. [2025-03-08 10:54:46,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1405 transitions. [2025-03-08 10:54:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 10:54:46,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:46,093 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:46,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:54:46,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -414248218, now seen corresponding path program 1 times [2025-03-08 10:54:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:54:46,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228467499] [2025-03-08 10:54:46,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:54:46,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 10:54:46,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 10:54:46,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:46,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:54:46,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:54:46,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 10:54:46,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 10:54:46,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:46,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:54:46,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:54:46,263 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:54:46,263 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:54:46,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:54:46,268 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:46,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:54:46,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:54:46 BoogieIcfgContainer [2025-03-08 10:54:46,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:54:46,403 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:54:46,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:54:46,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:54:46,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:33" (3/4) ... [2025-03-08 10:54:46,406 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:54:46,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:54:46,407 INFO L158 Benchmark]: Toolchain (without parser) took 13554.21ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.1MB in the beginning and 241.4MB in the end (delta: -120.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2025-03-08 10:54:46,407 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:54:46,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.13ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 106.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:54:46,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.72ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:54:46,408 INFO L158 Benchmark]: Boogie Preprocessor took 57.87ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 96.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:54:46,408 INFO L158 Benchmark]: IcfgBuilder took 621.56ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 65.8MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 10:54:46,408 INFO L158 Benchmark]: TraceAbstraction took 12537.61ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 65.4MB in the beginning and 241.5MB in the end (delta: -176.1MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2025-03-08 10:54:46,408 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 293.6MB. Free memory was 241.5MB in the beginning and 241.4MB in the end (delta: 87.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:54:46,409 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.31ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.13ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 106.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.72ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.87ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 96.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 621.56ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 65.8MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12537.61ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 65.4MB in the beginning and 241.5MB in the end (delta: -176.1MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 293.6MB. Free memory was 241.5MB in the beginning and 241.4MB in the end (delta: 87.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned char var_1_25 = 1; [L41] signed char var_1_26 = 50; [L42] signed char var_1_27 = 4; [L43] signed char var_1_28 = -10; [L44] signed char var_1_29 = -64; [L45] signed char var_1_30 = -8; [L46] signed long int var_1_31 = 1; [L47] float var_1_32 = 3.75; [L48] float var_1_33 = 8.5; [L49] unsigned char var_1_34 = 0; [L50] unsigned char var_1_35 = 8; [L51] unsigned short int var_1_36 = 5; [L52] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L162] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L172] RET updateLastVariables() [L173] CALL updateVariables() [L115] var_1_9 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L117] var_1_10 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L118] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L122] var_1_12 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L123] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L125] var_1_13 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L126] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L128] var_1_14 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L131] var_1_18 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L132] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L134] var_1_19 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L135] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L140] var_1_25 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L143] var_1_26 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L146] var_1_27 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L149] var_1_28 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L152] var_1_30 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L155] var_1_33 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L157] var_1_35 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L173] RET updateVariables() [L174] CALL step() [L56] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-127, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L61] var_1_29 = var_1_30 [L62] var_1_31 = var_1_29 [L63] var_1_32 = var_1_33 [L64] var_1_34 = var_1_35 [L65] var_1_36 = var_1_35 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L66] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L69] var_1_20 = var_1_8 [L70] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L74] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L75] COND FALSE !(\read(var_1_22)) [L82] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L84] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L85] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L86] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L87] COND FALSE !(\read(var_1_22)) [L94] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L99] signed long int stepLocal_4 = 256; [L100] unsigned char stepLocal_3 = var_1_22; [L101] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L102] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L105] COND FALSE !(stepLocal_3 || var_1_22) [L110] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165-L166] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=6, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-6, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-127, var_1_30=-127, var_1_31=-127, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 193 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1334 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1334 mSDsluCounter, 4901 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3005 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1331 IncrementalHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 1896 mSDtfsCounter, 1331 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1009occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 663 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2060 NumberOfCodeBlocks, 2060 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1859 ConstructedInterpolants, 0 QuantifiedInterpolants, 11312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 16184/16240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:54:46,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:54:48,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:54:48,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:54:48,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:54:48,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:54:48,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:54:48,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:54:48,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:54:48,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:54:48,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:54:48,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:54:48,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:54:48,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:54:48,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:54:48,452 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:54:48,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:54:48,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:54:48,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:54:48,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:54:48,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:54:48,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:54:48,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:54:48,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:54:48,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:54:48,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:54:48,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:54:48,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:54:48,455 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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2025-03-08 10:54:48,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:54:48,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:54:48,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:54:48,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:54:48,695 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:54:48,695 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-97.i [2025-03-08 10:54:49,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d028c579/4fcdd0406f254059a3198fc01876130f/FLAG06bec6523 [2025-03-08 10:54:50,171 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:54:50,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-08 10:54:50,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d028c579/4fcdd0406f254059a3198fc01876130f/FLAG06bec6523 [2025-03-08 10:54:50,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d028c579/4fcdd0406f254059a3198fc01876130f [2025-03-08 10:54:50,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:54:50,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:54:50,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:54:50,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:54:50,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:54:50,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9d1cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50, skipping insertion in model container [2025-03-08 10:54:50,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:54:50,328 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-97.i[915,928] [2025-03-08 10:54:50,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:54:50,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:54:50,422 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-97.i[915,928] [2025-03-08 10:54:50,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:54:50,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:54:50,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50 WrapperNode [2025-03-08 10:54:50,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:54:50,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:54:50,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:54:50,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:54:50,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,520 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-08 10:54:50,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:54:50,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:54:50,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:54:50,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:54:50,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,551 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:54:50,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:54:50,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:54:50,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:54:50,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:54:50,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (1/1) ... [2025-03-08 10:54:50,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:54:50,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:54:50,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:54:50,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:54:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:54:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:54:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:54:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:54:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:54:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:54:50,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:54:50,703 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:54:50,932 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:54:50,932 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:54:50,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:54:50,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:54:50,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:50 BoogieIcfgContainer [2025-03-08 10:54:50,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:54:50,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:54:50,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:54:50,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:54:50,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:54:50" (1/3) ... [2025-03-08 10:54:50,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495d36a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:54:50, skipping insertion in model container [2025-03-08 10:54:50,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:50" (2/3) ... [2025-03-08 10:54:50,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495d36a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:54:50, skipping insertion in model container [2025-03-08 10:54:50,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:50" (3/3) ... [2025-03-08 10:54:50,950 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-08 10:54:50,960 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:54:50,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:54:51,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:54:51,016 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;@67d7bf23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:54:51,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:54:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:54:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 10:54:51,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:51,032 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:51,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash 367891294, now seen corresponding path program 1 times [2025-03-08 10:54:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:54:51,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952554017] [2025-03-08 10:54:51,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:51,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:51,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:54:51,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:54:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:54:51,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 10:54:51,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 10:54:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:51,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:54:51,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:54:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2025-03-08 10:54:51,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:54:51,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:54:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952554017] [2025-03-08 10:54:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952554017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:54:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173812507] [2025-03-08 10:54:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:51,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:54:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:54:51,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:54:51,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:54:51,356 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 10:54:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:51,384 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2025-03-08 10:54:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:54:51,386 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2025-03-08 10:54:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:51,397 INFO L225 Difference]: With dead ends: 154 [2025-03-08 10:54:51,397 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 10:54:51,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:54:51,404 INFO L435 NwaCegarLoop]: 117 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, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:51,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:54:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 10:54:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 10:54:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:54:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-03-08 10:54:51,444 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 181 [2025-03-08 10:54:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:51,445 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-03-08 10:54:51,445 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 10:54:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-03-08 10:54:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 10:54:51,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:51,451 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:51,458 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 (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:54:51,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:51,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:51,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2045093403, now seen corresponding path program 1 times [2025-03-08 10:54:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:54:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265035162] [2025-03-08 10:54:51,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:51,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:51,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:54:51,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:54:51,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:54:51,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 10:54:51,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 10:54:51,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:51,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:51,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 10:54:51,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:54:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:52,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:54:52,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:54:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265035162] [2025-03-08 10:54:52,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265035162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:52,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:54:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381259992] [2025-03-08 10:54:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:52,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:54:52,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:54:52,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:54:52,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:54:52,223 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:52,587 INFO L93 Difference]: Finished difference Result 281 states and 432 transitions. [2025-03-08 10:54:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:54:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2025-03-08 10:54:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:52,592 INFO L225 Difference]: With dead ends: 281 [2025-03-08 10:54:52,592 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 10:54:52,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:54:52,596 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 111 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:52,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 555 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:54:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 10:54:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 149. [2025-03-08 10:54:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 88 states have internal predecessors, (112), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 10:54:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2025-03-08 10:54:52,629 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 181 [2025-03-08 10:54:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:52,630 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2025-03-08 10:54:52,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2025-03-08 10:54:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 10:54:52,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:52,632 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:52,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:54:52,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:52,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -452922534, now seen corresponding path program 1 times [2025-03-08 10:54:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:54:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494347993] [2025-03-08 10:54:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:52,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:54:52,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:54:52,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:54:52,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 10:54:52,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 10:54:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:52,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 10:54:52,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:54:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 838 proven. 39 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2025-03-08 10:54:53,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:54:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-08 10:54:53,362 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:54:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494347993] [2025-03-08 10:54:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494347993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:54:53,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:54:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 10:54:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828734232] [2025-03-08 10:54:53,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:54:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:54:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:54:53,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:54:53,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:54:53,364 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-08 10:54:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:53,661 INFO L93 Difference]: Finished difference Result 229 states and 344 transitions. [2025-03-08 10:54:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:54:53,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 181 [2025-03-08 10:54:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:53,665 INFO L225 Difference]: With dead ends: 229 [2025-03-08 10:54:53,667 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 10:54:53,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:54:53,670 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:53,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 151 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:54:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 10:54:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-03-08 10:54:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:54:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2025-03-08 10:54:53,686 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 181 [2025-03-08 10:54:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:53,687 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2025-03-08 10:54:53,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-08 10:54:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2025-03-08 10:54:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 10:54:53,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:53,689 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:53,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 10:54:53,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:53,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:53,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -743499897, now seen corresponding path program 1 times [2025-03-08 10:54:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:54:53,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173282066] [2025-03-08 10:54:53,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:54:53,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:54:53,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 10:54:53,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 10:54:54,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 10:54:54,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:54,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:54,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 10:54:54,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:54:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:54:54,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:54:54,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:54:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173282066] [2025-03-08 10:54:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173282066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:54:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:54:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:54:54,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568109587] [2025-03-08 10:54:54,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:54:54,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:54:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:54:54,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:54:54,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:54:54,653 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:54:54,868 INFO L93 Difference]: Finished difference Result 238 states and 337 transitions. [2025-03-08 10:54:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:54:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2025-03-08 10:54:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:54:54,870 INFO L225 Difference]: With dead ends: 238 [2025-03-08 10:54:54,870 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 10:54:54,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:54:54,871 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 62 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:54:54,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 345 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:54:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 10:54:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2025-03-08 10:54:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 90 states have internal predecessors, (103), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 10:54:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2025-03-08 10:54:54,908 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 182 [2025-03-08 10:54:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:54:54,909 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2025-03-08 10:54:54,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:54:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2025-03-08 10:54:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 10:54:54,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:54:54,912 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:54:54,918 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 (5)] Forceful destruction successful, exit code 0 [2025-03-08 10:54:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:55,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:54:55,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:54:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1426758947, now seen corresponding path program 1 times [2025-03-08 10:54:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:54:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624307188] [2025-03-08 10:54:55,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:54:55,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:54:55,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:54:55,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:54:55,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 10:54:55,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 10:54:55,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 10:54:55,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:54:55,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:54:55,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 10:54:55,583 INFO L279 TraceCheckSpWp]: Computing forward predicates...