./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.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 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:31:01,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:31:01,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:31:01,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:31:01,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:31:01,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:31:01,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:31:01,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:31:01,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:31:01,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:31:01,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:31:01,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:31:01,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:31:01,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:31:01,158 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:31:01,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:31:01,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:31:01,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:31:01,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:31:01,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:31:01,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:31:01,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:31:01,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:31:01,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:31:01,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:31:01,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:31:01,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:31:01,161 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 -> 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 [2025-03-03 20:31:01,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:31:01,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:31:01,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:31:01,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:31:01,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:31:01,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2025-03-03 20:31:02,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7953d849/1dbba09f3d7a44a4aadc3dcbe8aaa6a1/FLAGfda309942 [2025-03-03 20:31:02,809 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:31:02,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2025-03-03 20:31:02,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7953d849/1dbba09f3d7a44a4aadc3dcbe8aaa6a1/FLAGfda309942 [2025-03-03 20:31:02,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7953d849/1dbba09f3d7a44a4aadc3dcbe8aaa6a1 [2025-03-03 20:31:02,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:31:02,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:31:02,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:31:02,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:31:02,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:31:02,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:31:02" (1/1) ... [2025-03-03 20:31:02,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d64343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:02, skipping insertion in model container [2025-03-03 20:31:02,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:31:02" (1/1) ... [2025-03-03 20:31:02,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:31:02,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2025-03-03 20:31:03,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:31:03,013 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:31:03,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2025-03-03 20:31:03,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:31:03,073 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:31:03,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03 WrapperNode [2025-03-03 20:31:03,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:31:03,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:31:03,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:31:03,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:31:03,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,132 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2025-03-03 20:31:03,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:31:03,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:31:03,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:31:03,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:31:03,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,164 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:31:03,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:31:03,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:31:03,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:31:03,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:31:03,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (1/1) ... [2025-03-03 20:31:03,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:31:03,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:03,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:31:03,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:31:03,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:31:03,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:31:03,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:31:03,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:31:03,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:31:03,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:31:03,296 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:31:03,298 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:31:03,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc property_#t~bitwise28#1;havoc property_#t~short29#1;havoc property_#t~bitwise30#1;havoc property_#t~short31#1; [2025-03-03 20:31:03,757 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 20:31:03,757 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:31:03,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:31:03,783 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:31:03,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:31:03 BoogieIcfgContainer [2025-03-03 20:31:03,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:31:03,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:31:03,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:31:03,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:31:03,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:31:02" (1/3) ... [2025-03-03 20:31:03,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679f0f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:31:03, skipping insertion in model container [2025-03-03 20:31:03,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:03" (2/3) ... [2025-03-03 20:31:03,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679f0f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:31:03, skipping insertion in model container [2025-03-03 20:31:03,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:31:03" (3/3) ... [2025-03-03 20:31:03,791 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2025-03-03 20:31:03,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:31:03,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:31:03,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:31:03,877 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;@517aebb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:31:03,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:31:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 20:31:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 20:31:03,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:03,899 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:03,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 753439036, now seen corresponding path program 1 times [2025-03-03 20:31:03,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:03,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606801758] [2025-03-03 20:31:03,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:03,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 20:31:04,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 20:31:04,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:04,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 20:31:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606801758] [2025-03-03 20:31:04,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606801758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:31:04,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458393841] [2025-03-03 20:31:04,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:04,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:31:04,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:31:04,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 20:31:04,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 20:31:04,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:04,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:04,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:31:04,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:31:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 20:31:04,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:31:04,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458393841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:31:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:31:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619109150] [2025-03-03 20:31:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:04,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:31:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:04,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:31:04,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:31:04,443 INFO L87 Difference]: Start difference. First operand has 119 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:31:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:04,484 INFO L93 Difference]: Finished difference Result 232 states and 399 transitions. [2025-03-03 20:31:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:31:04,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 212 [2025-03-03 20:31:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:04,493 INFO L225 Difference]: With dead ends: 232 [2025-03-03 20:31:04,493 INFO L226 Difference]: Without dead ends: 116 [2025-03-03 20:31:04,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:31:04,501 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:04,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:31:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-03 20:31:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-03 20:31:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 20:31:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2025-03-03 20:31:04,536 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 212 [2025-03-03 20:31:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:04,536 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2025-03-03 20:31:04,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:31:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2025-03-03 20:31:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 20:31:04,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:04,543 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:04,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:31:04,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:31:04,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:04,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash 537138296, now seen corresponding path program 1 times [2025-03-03 20:31:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:04,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353549108] [2025-03-03 20:31:04,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:04,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 20:31:04,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 20:31:04,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:04,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 20:31:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353549108] [2025-03-03 20:31:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353549108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:31:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021122177] [2025-03-03 20:31:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:05,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:31:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:05,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:31:05,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:31:05,124 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:05,169 INFO L93 Difference]: Finished difference Result 230 states and 361 transitions. [2025-03-03 20:31:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:31:05,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-03 20:31:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:05,172 INFO L225 Difference]: With dead ends: 230 [2025-03-03 20:31:05,173 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 20:31:05,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:31:05,176 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:05,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:31:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 20:31:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-03 20:31:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 20:31:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 182 transitions. [2025-03-03 20:31:05,193 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 182 transitions. Word has length 212 [2025-03-03 20:31:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:05,195 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 182 transitions. [2025-03-03 20:31:05,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 182 transitions. [2025-03-03 20:31:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 20:31:05,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:05,198 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:05,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:31:05,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:05,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:05,199 INFO L85 PathProgramCache]: Analyzing trace with hash -288500604, now seen corresponding path program 1 times [2025-03-03 20:31:05,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:05,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007399080] [2025-03-03 20:31:05,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:05,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 20:31:05,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 20:31:05,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:05,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 20:31:05,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:05,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007399080] [2025-03-03 20:31:05,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007399080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:05,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:05,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:31:05,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323694931] [2025-03-03 20:31:05,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:05,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:31:05,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:05,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:31:05,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:31:05,913 INFO L87 Difference]: Start difference. First operand 117 states and 182 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:06,573 INFO L93 Difference]: Finished difference Result 380 states and 577 transitions. [2025-03-03 20:31:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:31:06,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-03 20:31:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:06,577 INFO L225 Difference]: With dead ends: 380 [2025-03-03 20:31:06,577 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 20:31:06,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:31:06,581 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 546 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:06,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 951 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:31:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 20:31:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2025-03-03 20:31:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 211 states have (on average 1.4549763033175356) internal successors, (307), 214 states have internal predecessors, (307), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:31:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2025-03-03 20:31:06,618 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 213 [2025-03-03 20:31:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:06,619 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2025-03-03 20:31:06,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2025-03-03 20:31:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 20:31:06,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:06,623 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:06,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:31:06,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:06,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1929257349, now seen corresponding path program 1 times [2025-03-03 20:31:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076630206] [2025-03-03 20:31:06,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:06,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 20:31:06,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 20:31:06,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:06,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 20:31:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076630206] [2025-03-03 20:31:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076630206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:07,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:31:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360224020] [2025-03-03 20:31:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:31:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:07,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:31:07,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:31:07,209 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:08,218 INFO L93 Difference]: Finished difference Result 806 states and 1211 transitions. [2025-03-03 20:31:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:31:08,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-03 20:31:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:08,225 INFO L225 Difference]: With dead ends: 806 [2025-03-03 20:31:08,225 INFO L226 Difference]: Without dead ends: 553 [2025-03-03 20:31:08,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:31:08,226 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 422 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:08,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1025 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:31:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-03 20:31:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 469. [2025-03-03 20:31:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 380 states have (on average 1.4578947368421054) internal successors, (554), 385 states have internal predecessors, (554), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:31:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 714 transitions. [2025-03-03 20:31:08,284 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 714 transitions. Word has length 213 [2025-03-03 20:31:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:08,285 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 714 transitions. [2025-03-03 20:31:08,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 714 transitions. [2025-03-03 20:31:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 20:31:08,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:08,289 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:08,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:31:08,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:08,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash 266452405, now seen corresponding path program 1 times [2025-03-03 20:31:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010450777] [2025-03-03 20:31:08,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:08,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 20:31:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 20:31:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:08,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 20:31:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010450777] [2025-03-03 20:31:08,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010450777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:31:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958939952] [2025-03-03 20:31:08,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:08,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:08,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:08,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:31:08,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:31:08,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 20:31:08,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 20:31:08,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:08,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:08,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 20:31:08,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:31:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 267 proven. 87 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-03-03 20:31:08,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:31:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 20:31:09,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958939952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:31:09,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:31:09,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 20:31:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429275384] [2025-03-03 20:31:09,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:31:09,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:31:09,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:09,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:31:09,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:31:09,134 INFO L87 Difference]: Start difference. First operand 469 states and 714 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-03 20:31:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:09,443 INFO L93 Difference]: Finished difference Result 639 states and 961 transitions. [2025-03-03 20:31:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:31:09,444 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 214 [2025-03-03 20:31:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:09,446 INFO L225 Difference]: With dead ends: 639 [2025-03-03 20:31:09,446 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 20:31:09,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:31:09,447 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 187 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:09,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 471 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:31:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 20:31:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2025-03-03 20:31:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 263 states have (on average 1.429657794676806) internal successors, (376), 265 states have internal predecessors, (376), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 20:31:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 520 transitions. [2025-03-03 20:31:09,476 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 520 transitions. Word has length 214 [2025-03-03 20:31:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:09,476 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 520 transitions. [2025-03-03 20:31:09,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-03 20:31:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 520 transitions. [2025-03-03 20:31:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 20:31:09,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:09,478 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:09,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:31:09,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:09,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:09,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -479310697, now seen corresponding path program 1 times [2025-03-03 20:31:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:09,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078444844] [2025-03-03 20:31:09,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:09,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 20:31:09,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 20:31:09,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:09,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 20:31:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078444844] [2025-03-03 20:31:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078444844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:31:10,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775848065] [2025-03-03 20:31:10,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:10,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:31:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:10,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:31:10,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:31:10,345 INFO L87 Difference]: Start difference. First operand 344 states and 520 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:11,907 INFO L93 Difference]: Finished difference Result 1137 states and 1683 transitions. [2025-03-03 20:31:11,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:31:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-03 20:31:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:11,911 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 20:31:11,911 INFO L226 Difference]: Without dead ends: 796 [2025-03-03 20:31:11,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-03 20:31:11,913 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 487 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:11,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1135 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:31:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-03 20:31:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 670. [2025-03-03 20:31:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 563 states have (on average 1.4671403197158082) internal successors, (826), 571 states have internal predecessors, (826), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 80 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 20:31:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1002 transitions. [2025-03-03 20:31:11,969 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1002 transitions. Word has length 214 [2025-03-03 20:31:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:11,972 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1002 transitions. [2025-03-03 20:31:11,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1002 transitions. [2025-03-03 20:31:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 20:31:11,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:11,974 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:11,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:31:11,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:11,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash 297472212, now seen corresponding path program 1 times [2025-03-03 20:31:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:11,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030493510] [2025-03-03 20:31:11,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:11,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 20:31:12,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 20:31:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 20:31:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030493510] [2025-03-03 20:31:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030493510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:31:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088369758] [2025-03-03 20:31:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:12,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:31:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:12,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:31:12,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:31:12,400 INFO L87 Difference]: Start difference. First operand 670 states and 1002 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:31:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:13,374 INFO L93 Difference]: Finished difference Result 1676 states and 2482 transitions. [2025-03-03 20:31:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:31:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 214 [2025-03-03 20:31:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:13,380 INFO L225 Difference]: With dead ends: 1676 [2025-03-03 20:31:13,380 INFO L226 Difference]: Without dead ends: 1009 [2025-03-03 20:31:13,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:31:13,384 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1215 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:13,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 975 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:31:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-03 20:31:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 893. [2025-03-03 20:31:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 744 states have (on average 1.4650537634408602) internal successors, (1090), 754 states have internal predecessors, (1090), 124 states have call successors, (124), 24 states have call predecessors, (124), 24 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 20:31:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1338 transitions. [2025-03-03 20:31:13,493 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1338 transitions. Word has length 214 [2025-03-03 20:31:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:13,494 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1338 transitions. [2025-03-03 20:31:13,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:31:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1338 transitions. [2025-03-03 20:31:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 20:31:13,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:13,498 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:13,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:31:13,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1752087512, now seen corresponding path program 1 times [2025-03-03 20:31:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710236842] [2025-03-03 20:31:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:13,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 20:31:13,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 20:31:13,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:13,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 20:31:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710236842] [2025-03-03 20:31:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710236842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:31:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57450631] [2025-03-03 20:31:13,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:13,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:31:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:13,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:31:13,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:31:13,707 INFO L87 Difference]: Start difference. First operand 893 states and 1338 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:14,162 INFO L93 Difference]: Finished difference Result 2137 states and 3173 transitions. [2025-03-03 20:31:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:31:14,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-03 20:31:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:14,168 INFO L225 Difference]: With dead ends: 2137 [2025-03-03 20:31:14,168 INFO L226 Difference]: Without dead ends: 1247 [2025-03-03 20:31:14,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:31:14,172 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 71 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:14,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 745 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:31:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2025-03-03 20:31:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 952. [2025-03-03 20:31:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 803 states have (on average 1.4794520547945205) internal successors, (1188), 813 states have internal predecessors, (1188), 124 states have call successors, (124), 24 states have call predecessors, (124), 24 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 20:31:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1436 transitions. [2025-03-03 20:31:14,240 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1436 transitions. Word has length 214 [2025-03-03 20:31:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1436 transitions. [2025-03-03 20:31:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 20:31:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1436 transitions. [2025-03-03 20:31:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 20:31:14,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:14,244 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:14,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:31:14,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:14,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1353693182, now seen corresponding path program 1 times [2025-03-03 20:31:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:14,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452988558] [2025-03-03 20:31:14,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:14,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 20:31:14,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 20:31:14,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:14,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 20:31:14,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452988558] [2025-03-03 20:31:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452988558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:31:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599911527] [2025-03-03 20:31:14,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:14,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:31:14,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:31:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 20:31:14,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 20:31:14,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:14,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:14,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 20:31:14,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:31:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 879 proven. 30 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2025-03-03 20:31:14,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:31:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 20:31:15,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599911527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:31:15,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:31:15,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 6] total 14 [2025-03-03 20:31:15,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433960341] [2025-03-03 20:31:15,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:31:15,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:31:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:15,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:31:15,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:31:15,052 INFO L87 Difference]: Start difference. First operand 952 states and 1436 transitions. Second operand has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-03-03 20:31:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:15,441 INFO L93 Difference]: Finished difference Result 1934 states and 2895 transitions. [2025-03-03 20:31:15,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:31:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) Word has length 215 [2025-03-03 20:31:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:15,446 INFO L225 Difference]: With dead ends: 1934 [2025-03-03 20:31:15,446 INFO L226 Difference]: Without dead ends: 985 [2025-03-03 20:31:15,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-03-03 20:31:15,448 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 388 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:15,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 487 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:31:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-03-03 20:31:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 973. [2025-03-03 20:31:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 818 states have (on average 1.4156479217603912) internal successors, (1158), 828 states have internal predecessors, (1158), 124 states have call successors, (124), 30 states have call predecessors, (124), 30 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 20:31:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1406 transitions. [2025-03-03 20:31:15,503 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1406 transitions. Word has length 215 [2025-03-03 20:31:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:15,503 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1406 transitions. [2025-03-03 20:31:15,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-03-03 20:31:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1406 transitions. [2025-03-03 20:31:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 20:31:15,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:15,505 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:15,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:31:15,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:15,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:15,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash 791418475, now seen corresponding path program 1 times [2025-03-03 20:31:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:15,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992954939] [2025-03-03 20:31:15,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:15,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:15,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:31:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:31:15,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:31:15,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228822419] [2025-03-03 20:31:15,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:15,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:15,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:31:15,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:31:15,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:31:15,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:31:15,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:15,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:15,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 20:31:15,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:31:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1030 proven. 96 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2025-03-03 20:31:16,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:31:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 20:31:16,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:31:16,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992954939] [2025-03-03 20:31:16,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:31:16,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228822419] [2025-03-03 20:31:16,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228822419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:31:16,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:31:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-03 20:31:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879588494] [2025-03-03 20:31:16,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:31:16,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 20:31:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:31:16,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 20:31:16,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-03-03 20:31:16,831 INFO L87 Difference]: Start difference. First operand 973 states and 1406 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2025-03-03 20:31:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:17,862 INFO L93 Difference]: Finished difference Result 2592 states and 3638 transitions. [2025-03-03 20:31:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 20:31:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) Word has length 216 [2025-03-03 20:31:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:17,868 INFO L225 Difference]: With dead ends: 2592 [2025-03-03 20:31:17,868 INFO L226 Difference]: Without dead ends: 1622 [2025-03-03 20:31:17,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1119, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 20:31:17,870 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 971 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:17,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 687 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:31:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-03 20:31:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1095. [2025-03-03 20:31:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 899 states have (on average 1.371523915461624) internal successors, (1233), 911 states have internal predecessors, (1233), 152 states have call successors, (152), 43 states have call predecessors, (152), 43 states have return successors, (152), 140 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-03 20:31:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1537 transitions. [2025-03-03 20:31:17,938 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1537 transitions. Word has length 216 [2025-03-03 20:31:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:17,939 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1537 transitions. [2025-03-03 20:31:17,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2025-03-03 20:31:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1537 transitions. [2025-03-03 20:31:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:31:17,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:17,941 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:17,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 20:31:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:18,146 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:18,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash 984643340, now seen corresponding path program 1 times [2025-03-03 20:31:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:31:18,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153076841] [2025-03-03 20:31:18,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:31:18,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:31:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:31:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:31:18,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105946893] [2025-03-03 20:31:18,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:18,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:31:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:18,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:31:18,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:31:18,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:31:18,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:31:18,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:18,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:31:18,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:31:18,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:31:18,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:31:18,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:18,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:31:18,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:31:18,528 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:31:18,529 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:31:18,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 20:31:18,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 20:31:18,732 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:18,837 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:31:18,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:31:18 BoogieIcfgContainer [2025-03-03 20:31:18,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:31:18,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:31:18,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:31:18,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:31:18,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:31:03" (3/4) ... [2025-03-03 20:31:18,842 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:31:18,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:31:18,843 INFO L158 Benchmark]: Toolchain (without parser) took 16002.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 114.2MB in the beginning and 252.0MB in the end (delta: -137.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2025-03-03 20:31:18,843 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:31:18,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.21ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 98.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:31:18,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.68ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 92.0MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:31:18,843 INFO L158 Benchmark]: Boogie Preprocessor took 53.89ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 85.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:31:18,844 INFO L158 Benchmark]: IcfgBuilder took 595.42ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 46.2MB in the end (delta: 39.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 20:31:18,844 INFO L158 Benchmark]: TraceAbstraction took 15053.96ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 45.3MB in the beginning and 252.0MB in the end (delta: -206.7MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2025-03-03 20:31:18,844 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 302.0MB. Free memory was 252.0MB in the beginning and 252.0MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:31:18,845 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.21ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 98.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.68ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 92.0MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.89ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 85.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 595.42ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 46.2MB in the end (delta: 39.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15053.96ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 45.3MB in the beginning and 252.0MB in the end (delta: -206.7MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 302.0MB. Free memory was 252.0MB in the beginning and 252.0MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of bitwiseOr at line 98, overapproximation of someUnaryDOUBLEoperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; [L43] unsigned char var_1_24 = 0; [L44] unsigned char var_1_25 = 0; [L45] float var_1_26 = 1000000000000.6; [L46] unsigned long int var_1_27 = 2609431563; [L47] float var_1_30 = 8.8; [L48] unsigned short int var_1_32 = 1; [L49] signed char var_1_36 = 64; [L50] float var_1_37 = 9.5; [L51] signed long int var_1_41 = 200; [L52] signed char var_1_42 = 2; [L53] signed long int var_1_43 = 2; VAL [isInitial=0, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=-1, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L131] var_1_2 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L132] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L134] var_1_3 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] var_1_5 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L138] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L141] var_1_6 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L144] var_1_8 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L145] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L146] var_1_9 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L147] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L148] var_1_10 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L149] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L150] var_1_11 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L151] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L152] var_1_12 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L153] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L154] var_1_14 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L155] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L156] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L156] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L157] var_1_15 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L158] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L159] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L159] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L160] var_1_16 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L161] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L162] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L162] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L163] var_1_17 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L164] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L165] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L165] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L166] var_1_18 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L168] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L168] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L169] var_1_19 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L170] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L171] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L171] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L174] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L174] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L176] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L178] var_1_37 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L179] RET assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L180] CALL assume_abort_if_not(var_1_37 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L180] RET assume_abort_if_not(var_1_37 != 0.0F) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L193] RET updateVariables() [L194] CALL step() [L57] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L58] COND TRUE -256 <= stepLocal_0 [L59] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L65] COND TRUE var_1_11 <= var_1_9 [L66] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L68] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L69] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L77] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L77] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L78] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L81] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L81] signed long int stepLocal_2 = var_1_1 & var_1_3; [L82] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L89] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L91] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L92] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1] [L93] COND TRUE ! (! var_1_6) [L94] var_1_23 = var_1_8 VAL [isInitial=1, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L97] var_1_24 = var_1_25 VAL [isInitial=1, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L98] EXPR 25u | (var_1_27 - 5u) VAL [isInitial=1, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L98] COND TRUE (25u | (var_1_27 - 5u)) >= var_1_5 [L99] var_1_26 = (((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) < 0 ) ? -((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) : ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L105] COND TRUE var_1_10 < var_1_8 [L106] var_1_30 = ((((var_1_8) > (var_1_11)) ? (var_1_8) : (var_1_11))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L108] EXPR (var_1_1 / var_1_14) & var_1_5 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L108] COND TRUE (-1 - var_1_15) < ((var_1_1 / var_1_14) & var_1_5) [L109] EXPR var_1_14 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L109] COND TRUE (- ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < (var_1_14 >> var_1_15) [L110] var_1_32 = var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L117] COND FALSE !(var_1_10 < ((var_1_8 / var_1_37) + var_1_11)) [L122] var_1_36 = ((((var_1_18) > ((var_1_18 - var_1_18))) ? (var_1_18) : ((var_1_18 - var_1_18)))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L124] EXPR var_1_27 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_8=3] [L124] COND FALSE !((var_1_27 >> var_1_15) <= var_1_18) [L127] var_1_42 = var_1_17 [L128] var_1_43 = var_1_3 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=63, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=63, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L185] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=63, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L185-L186] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=63, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=190, var_1_15=0, var_1_16=127, var_1_17=-193, var_1_18=-255, var_1_19=-449, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=63, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 11, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4357 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4287 mSDsluCounter, 6988 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5286 mSDsCounter, 584 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5105 IncrementalHoareTripleChecker+Invalid, 5689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 584 mSolverCounterUnsat, 1702 mSDtfsCounter, 5105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1634 GetRequests, 1501 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1095occurred in iteration=10, InterpolantAutomatonStates: 112, 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, 10 MinimizatonAttempts, 1174 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 3428 NumberOfCodeBlocks, 3428 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3407 ConstructedInterpolants, 1 QuantifiedInterpolants, 9147 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1916 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 31226/31744 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 20:31:18,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.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 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:31:20,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:31:20,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:31:20,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:31:20,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:31:20,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:31:20,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:31:20,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:31:20,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:31:20,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:31:20,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:31:20,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:31:20,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:31:20,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:31:20,735 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:31:20,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:31:20,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:31:20,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:31:20,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:31:20,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:31:20,736 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 -> 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 [2025-03-03 20:31:20,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:31:20,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:31:20,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:31:20,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:31:20,980 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:31:20,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2025-03-03 20:31:22,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe056c85/f9fb459368174a06bb5dfca4e952dfce/FLAG183756a47 [2025-03-03 20:31:22,287 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:31:22,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2025-03-03 20:31:22,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe056c85/f9fb459368174a06bb5dfca4e952dfce/FLAG183756a47 [2025-03-03 20:31:22,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe056c85/f9fb459368174a06bb5dfca4e952dfce [2025-03-03 20:31:22,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:31:22,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:31:22,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:31:22,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:31:22,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:31:22,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f31ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22, skipping insertion in model container [2025-03-03 20:31:22,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:31:22,748 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2025-03-03 20:31:22,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:31:22,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:31:22,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2025-03-03 20:31:22,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:31:22,831 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:31:22,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22 WrapperNode [2025-03-03 20:31:22,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:31:22,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:31:22,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:31:22,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:31:22,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,873 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-03-03 20:31:22,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:31:22,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:31:22,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:31:22,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:31:22,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:31:22,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:31:22,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:31:22,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:31:22,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:31:22,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (1/1) ... [2025-03-03 20:31:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:31:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:22,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:31:22,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:31:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:31:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:31:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:31:22,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:31:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:31:22,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:31:23,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:31:23,019 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:31:39,026 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 20:31:39,026 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:31:39,035 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:31:39,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:31:39,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:31:39 BoogieIcfgContainer [2025-03-03 20:31:39,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:31:39,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:31:39,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:31:39,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:31:39,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:31:22" (1/3) ... [2025-03-03 20:31:39,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290da4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:31:39, skipping insertion in model container [2025-03-03 20:31:39,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:22" (2/3) ... [2025-03-03 20:31:39,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290da4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:31:39, skipping insertion in model container [2025-03-03 20:31:39,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:31:39" (3/3) ... [2025-03-03 20:31:39,043 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2025-03-03 20:31:39,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:31:39,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:31:39,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:31:39,093 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;@7733a003, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:31:39,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:31:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 20:31:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 20:31:39,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:39,103 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:39,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:39,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1790202147, now seen corresponding path program 1 times [2025-03-03 20:31:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:31:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478417031] [2025-03-03 20:31:39,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:39,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-03 20:31:39,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:31:39,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:31:39,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 20:31:39,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 20:31:40,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 20:31:40,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:40,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:40,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:31:40,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:31:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 20:31:40,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:31:40,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:31:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478417031] [2025-03-03 20:31:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478417031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:31:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:31:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:31:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980240727] [2025-03-03 20:31:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:31:40,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:31:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:31:40,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:31:40,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:31:40,260 INFO L87 Difference]: Start difference. First operand has 91 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:31:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:31:40,288 INFO L93 Difference]: Finished difference Result 175 states and 309 transitions. [2025-03-03 20:31:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:31:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-03 20:31:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:31:40,296 INFO L225 Difference]: With dead ends: 175 [2025-03-03 20:31:40,296 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 20:31:40,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:31:40,303 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:31:40,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:31:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 20:31:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 20:31:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 20:31:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2025-03-03 20:31:40,343 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 203 [2025-03-03 20:31:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:31:40,343 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2025-03-03 20:31:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:31:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2025-03-03 20:31:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 20:31:40,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:31:40,348 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:31:40,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 20:31:40,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:31:40,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:31:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:31:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1478469599, now seen corresponding path program 1 times [2025-03-03 20:31:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:31:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510157537] [2025-03-03 20:31:40,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:31:40,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:31:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:31:40,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:31:40,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 20:31:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 20:31:41,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 20:31:41,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:31:41,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:31:41,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 20:31:41,943 INFO L279 TraceCheckSpWp]: Computing forward predicates...