./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_codestructure_dependencies_file-43.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 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:02:25,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:02:25,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:02:25,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:02:25,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:02:25,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:02:25,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:02:25,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:02:25,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:02:25,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:02:25,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:02:25,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:02:25,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:02:25,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:02:25,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:02:25,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:02:25,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:02:25,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:02:25,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:02:25,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:02:25,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:02:25,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:02:25,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:02:25,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:02:25,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:02:25,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:02:25,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:02:25,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:02:25,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:02:25,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:02:25,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:02:25,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:02:25,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:02:25,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:02:25,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:02:25,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:02:25,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:02:25,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:02:25,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:02:25,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:02:25,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:02:25,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:02:25,174 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 [2024-11-12 01:02:25,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:02:25,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:02:25,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:02:25,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:02:25,428 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:02:25,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-12 01:02:26,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:02:27,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:02:27,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-12 01:02:27,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a957446/252e195e42444546aab8b81fd58fee09/FLAG86bf4707b [2024-11-12 01:02:27,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a957446/252e195e42444546aab8b81fd58fee09 [2024-11-12 01:02:27,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:02:27,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:02:27,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:02:27,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:02:27,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:02:27,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681b3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27, skipping insertion in model container [2024-11-12 01:02:27,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:02:27,270 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_codestructure_dependencies_file-43.i[919,932] [2024-11-12 01:02:27,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:02:27,359 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:02:27,374 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_codestructure_dependencies_file-43.i[919,932] [2024-11-12 01:02:27,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:02:27,429 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:02:27,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27 WrapperNode [2024-11-12 01:02:27,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:02:27,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:02:27,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:02:27,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:02:27,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,488 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2024-11-12 01:02:27,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:02:27,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:02:27,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:02:27,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:02:27,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,518 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]. [2024-11-12 01:02:27,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:02:27,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:02:27,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:02:27,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:02:27,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (1/1) ... [2024-11-12 01:02:27,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:02:27,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:02:27,584 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) [2024-11-12 01:02:27,588 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 [2024-11-12 01:02:27,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:02:27,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:02:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:02:27,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:02:27,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:02:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:02:27,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:02:27,737 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:02:28,057 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 01:02:28,057 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:02:28,073 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:02:28,073 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:02:28,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:28 BoogieIcfgContainer [2024-11-12 01:02:28,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:02:28,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:02:28,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:02:28,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:02:28,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:02:27" (1/3) ... [2024-11-12 01:02:28,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e842148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:28, skipping insertion in model container [2024-11-12 01:02:28,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:27" (2/3) ... [2024-11-12 01:02:28,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e842148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:28, skipping insertion in model container [2024-11-12 01:02:28,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:28" (3/3) ... [2024-11-12 01:02:28,085 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-43.i [2024-11-12 01:02:28,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:02:28,099 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:02:28,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:02:28,157 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;@20bc0ffb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:02:28,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:02:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:02:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:02:28,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:02:28,177 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:02:28,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:02:28,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:02:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -738818967, now seen corresponding path program 1 times [2024-11-12 01:02:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:02:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357290957] [2024-11-12 01:02:28,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:02:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:02:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:02:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 01:02:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 01:02:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:02:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 01:02:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 01:02:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 01:02:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 01:02:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 01:02:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 01:02:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 01:02:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:02:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 01:02:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 01:02:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 01:02:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 01:02:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 01:02:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 01:02:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 01:02:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:02:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:02:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 01:02:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 01:02:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 01:02:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 01:02:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:02:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:02:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:02:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357290957] [2024-11-12 01:02:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357290957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:02:28,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:02:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:02:28,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165347142] [2024-11-12 01:02:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:02:28,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:02:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:02:28,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:02:28,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:02:28,690 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:02:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:02:28,725 INFO L93 Difference]: Finished difference Result 149 states and 260 transitions. [2024-11-12 01:02:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:02:28,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-12 01:02:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:02:28,736 INFO L225 Difference]: With dead ends: 149 [2024-11-12 01:02:28,737 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 01:02:28,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:02:28,744 INFO L435 NwaCegarLoop]: 113 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, 113 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 [2024-11-12 01:02:28,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:02:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 01:02:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-12 01:02:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:02:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-12 01:02:28,798 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 164 [2024-11-12 01:02:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:02:28,800 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-12 01:02:28,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:02:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-12 01:02:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:02:28,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:02:28,804 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:02:28,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:02:28,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:02:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:02:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -133654615, now seen corresponding path program 1 times [2024-11-12 01:02:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:02:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485746396] [2024-11-12 01:02:28,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:02:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:02:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:02:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 01:02:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 01:02:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:02:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 01:02:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 01:02:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 01:02:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 01:02:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 01:02:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 01:02:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 01:02:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:02:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 01:02:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 01:02:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 01:02:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 01:02:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 01:02:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 01:02:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 01:02:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:02:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:02:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 01:02:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 01:02:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 01:02:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 01:02:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:02:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:02:29,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:02:29,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485746396] [2024-11-12 01:02:29,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485746396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:02:29,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:02:29,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:02:29,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646767231] [2024-11-12 01:02:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:02:29,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:02:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:02:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:02:29,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:02:29,241 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:02:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:02:29,282 INFO L93 Difference]: Finished difference Result 146 states and 225 transitions. [2024-11-12 01:02:29,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:02:29,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-12 01:02:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:02:29,286 INFO L225 Difference]: With dead ends: 146 [2024-11-12 01:02:29,288 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 01:02:29,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:02:29,291 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:02:29,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:02:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 01:02:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 01:02:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:02:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-12 01:02:29,313 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 164 [2024-11-12 01:02:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:02:29,319 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-12 01:02:29,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:02:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-12 01:02:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:02:29,324 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:02:29,324 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:02:29,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:02:29,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:02:29,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:02:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1641352747, now seen corresponding path program 1 times [2024-11-12 01:02:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:02:29,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21348291] [2024-11-12 01:02:29,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:02:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:02:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:02:29,513 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:02:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:02:29,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:02:29,681 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:02:29,682 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:02:29,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:02:29,687 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 01:02:29,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:02:29,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:02:29 BoogieIcfgContainer [2024-11-12 01:02:29,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:02:29,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:02:29,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:02:29,803 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:02:29,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:28" (3/4) ... [2024-11-12 01:02:29,807 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:02:29,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:02:29,811 INFO L158 Benchmark]: Toolchain (without parser) took 2746.58ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 102.7MB in the beginning and 77.9MB in the end (delta: 24.8MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2024-11-12 01:02:29,812 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:02:29,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.31ms. Allocated memory is still 151.0MB. Free memory was 102.3MB in the beginning and 85.9MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 01:02:29,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.28ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 82.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:02:29,813 INFO L158 Benchmark]: Boogie Preprocessor took 56.16ms. Allocated memory is still 151.0MB. Free memory was 82.6MB in the beginning and 78.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:02:29,814 INFO L158 Benchmark]: RCFGBuilder took 524.15ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 113.0MB in the end (delta: -34.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-12 01:02:29,814 INFO L158 Benchmark]: TraceAbstraction took 1726.93ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 112.2MB in the beginning and 79.0MB in the end (delta: 33.3MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2024-11-12 01:02:29,814 INFO L158 Benchmark]: Witness Printer took 5.72ms. Allocated memory is still 195.0MB. Free memory was 79.0MB in the beginning and 77.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:02:29,818 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.19ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.31ms. Allocated memory is still 151.0MB. Free memory was 102.3MB in the beginning and 85.9MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.28ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 82.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.16ms. Allocated memory is still 151.0MB. Free memory was 82.6MB in the beginning and 78.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.15ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 113.0MB in the end (delta: -34.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1726.93ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 112.2MB in the beginning and 79.0MB in the end (delta: 33.3MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 5.72ms. Allocated memory is still 195.0MB. Free memory was 79.0MB in the beginning and 77.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed char var_1_10 = 64; [L30] signed short int var_1_11 = 5; [L31] unsigned short int var_1_12 = 4; [L32] unsigned char var_1_13 = 1; [L33] unsigned short int var_1_14 = 49632; [L34] unsigned short int var_1_15 = 0; [L35] signed char var_1_16 = 50; [L36] signed char var_1_18 = 2; [L37] signed char var_1_19 = 25; [L38] signed char var_1_20 = 10; [L39] signed char var_1_21 = 1; [L40] signed char var_1_22 = 8; [L41] unsigned long int var_1_23 = 25; [L42] unsigned short int var_1_24 = 32; [L43] signed long int var_1_26 = 50; [L44] signed char last_1_var_1_7 = 32; [L45] signed short int last_1_var_1_11 = 5; [L46] signed long int last_1_var_1_26 = 50; VAL [isInitial=0, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L130] last_1_var_1_7 = var_1_7 [L131] last_1_var_1_11 = var_1_11 [L132] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L88] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L89] var_1_3 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L90] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L91] var_1_4 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L92] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L93] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L93] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L94] var_1_5 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L95] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L96] var_1_6 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L97] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L98] var_1_10 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L99] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L100] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L100] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L101] var_1_13 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L103] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L103] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L104] var_1_14 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L105] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L106] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L106] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L107] var_1_15 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L108] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L109] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L109] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L110] var_1_18 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L111] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L112] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L112] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L113] var_1_19 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L114] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L115] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L115] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L116] var_1_20 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L117] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L118] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L118] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L119] var_1_21 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L120] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L121] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L121] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L122] var_1_22 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L123] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L124] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L124] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L125] var_1_24 = __VERIFIER_nondet_ushort() [L126] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L126] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L127] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32640, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32640, var_1_26=50, var_1_7=32] [L127] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=5003/5, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32640, var_1_26=50, var_1_7=32] [L143] RET updateVariables() [L144] CALL step() [L50] COND TRUE (- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4)) [L51] var_1_1 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L55] COND TRUE var_1_1 > var_1_4 [L56] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=4, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L60] COND TRUE \read(var_1_13) [L61] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=50, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L63] COND TRUE var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1) [L64] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=-126, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L72] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L73] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=-126, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=32644, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L77] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=-126, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=32644, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L82] EXPR var_1_12 & last_1_var_1_7 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=-126, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=32644, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L82] COND FALSE !(-4 > (var_1_12 & last_1_var_1_7)) [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=-126, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=32644, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L135-L136] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((last_1_var_1_11) < (((16 - 32) + (64 + var_1_10)))) ? (last_1_var_1_11) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_12)) ? (var_1_14) : (var_1_12))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < last_1_var_1_26) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=-126, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=32644, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=-126, var_1_11=-126, var_1_12=0, var_1_13=1, var_1_14=2147516415, var_1_15=-32769, var_1_16=-126, var_1_18=-62, var_1_19=-63, var_1_1=2147516420, var_1_20=-62, var_1_21=126, var_1_22=0, var_1_23=32644, var_1_24=32640, var_1_26=50, var_1_5=2147516420, var_1_6=2147516420, var_1_7=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 225 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 01:02:29,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_codestructure_dependencies_file-43.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 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:02:32,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:02:32,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:02:32,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:02:32,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:02:32,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:02:32,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:02:32,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:02:32,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:02:32,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:02:32,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:02:32,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:02:32,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:02:32,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:02:32,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:02:32,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:02:32,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:02:32,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:02:32,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:02:32,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:02:32,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:02:32,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:02:32,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:02:32,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:02:32,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:02:32,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:02:32,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:02:32,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:02:32,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:02:32,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:02:32,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:02:32,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:02:32,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:02:32,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:02:32,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:02:32,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:02:32,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:02:32,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:02:32,139 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:02:32,139 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:02:32,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:02:32,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:02:32,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:02:32,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:02:32,141 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0c17c914e863ecde37b0d9eebaa4b759e86beaa02deb4bbf5ca1b0e732d82914 [2024-11-12 01:02:32,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:02:32,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:02:32,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:02:32,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:02:32,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:02:32,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-12 01:02:33,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:02:34,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:02:34,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-43.i [2024-11-12 01:02:34,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5ae0e0a/3abf27a2310c4b4ea6dc349f0274250d/FLAGbffefbed6 [2024-11-12 01:02:34,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5ae0e0a/3abf27a2310c4b4ea6dc349f0274250d [2024-11-12 01:02:34,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:02:34,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:02:34,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:02:34,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:02:34,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:02:34,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151add00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34, skipping insertion in model container [2024-11-12 01:02:34,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:02:34,669 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_codestructure_dependencies_file-43.i[919,932] [2024-11-12 01:02:34,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:02:34,773 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:02:34,787 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_codestructure_dependencies_file-43.i[919,932] [2024-11-12 01:02:34,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:02:34,860 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:02:34,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34 WrapperNode [2024-11-12 01:02:34,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:02:34,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:02:34,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:02:34,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:02:34,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,912 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-11-12 01:02:34,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:02:34,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:02:34,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:02:34,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:02:34,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,943 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]. [2024-11-12 01:02:34,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:02:34,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:02:34,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:02:34,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:02:34,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (1/1) ... [2024-11-12 01:02:34,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:02:35,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:02:35,017 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) [2024-11-12 01:02:35,023 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 [2024-11-12 01:02:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:02:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:02:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:02:35,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:02:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:02:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:02:35,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:02:35,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:02:44,908 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:02:44,908 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:02:44,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:02:44,924 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:02:44,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:44 BoogieIcfgContainer [2024-11-12 01:02:44,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:02:44,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:02:44,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:02:44,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:02:44,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:02:34" (1/3) ... [2024-11-12 01:02:44,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eb32f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:44, skipping insertion in model container [2024-11-12 01:02:44,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:34" (2/3) ... [2024-11-12 01:02:44,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eb32f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:44, skipping insertion in model container [2024-11-12 01:02:44,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:44" (3/3) ... [2024-11-12 01:02:44,932 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-43.i [2024-11-12 01:02:44,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:02:44,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:02:45,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:02:45,016 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f588b92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:02:45,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:02:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:02:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 01:02:45,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:02:45,038 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:02:45,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:02:45,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:02:45,046 INFO L85 PathProgramCache]: Analyzing trace with hash 756674184, now seen corresponding path program 1 times [2024-11-12 01:02:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:02:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231500073] [2024-11-12 01:02:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:02:45,063 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 [2024-11-12 01:02:45,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:02:45,067 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) [2024-11-12 01:02:45,068 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 [2024-11-12 01:02:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:45,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:02:45,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:02:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2024-11-12 01:02:45,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:02:45,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:02:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231500073] [2024-11-12 01:02:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231500073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:02:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:02:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:02:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997478310] [2024-11-12 01:02:45,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:02:45,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:02:45,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:02:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:02:45,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:02:45,744 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:02:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:02:45,778 INFO L93 Difference]: Finished difference Result 131 states and 232 transitions. [2024-11-12 01:02:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:02:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2024-11-12 01:02:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:02:45,787 INFO L225 Difference]: With dead ends: 131 [2024-11-12 01:02:45,787 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 01:02:45,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:02:45,793 INFO L435 NwaCegarLoop]: 98 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, 98 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 [2024-11-12 01:02:45,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:02:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 01:02:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-12 01:02:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:02:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 98 transitions. [2024-11-12 01:02:45,834 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 98 transitions. Word has length 161 [2024-11-12 01:02:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:02:45,835 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 98 transitions. [2024-11-12 01:02:45,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:02:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 98 transitions. [2024-11-12 01:02:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 01:02:45,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:02:45,842 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:02:45,854 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 [2024-11-12 01:02:46,044 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 [2024-11-12 01:02:46,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:02:46,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:02:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -464596406, now seen corresponding path program 1 times [2024-11-12 01:02:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:02:46,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754511399] [2024-11-12 01:02:46,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:02:46,047 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 [2024-11-12 01:02:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:02:46,048 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) [2024-11-12 01:02:46,049 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 [2024-11-12 01:02:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:46,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 01:02:46,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:03:09,816 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 01:03:34,853 WARN L286 SmtUtils]: Spent 13.72s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 01:03:43,409 WARN L286 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 01:03:49,151 WARN L286 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 01:04:00,188 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)