./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-24.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 b7fe6678e6dee0757bbafd48f1956712f3f9f10de2405846c9036c2565c43ad1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:55:40,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:55:40,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:55:40,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:55:40,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:55:40,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:55:40,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:55:40,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:55:40,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:55:40,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:55:40,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:55:40,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:55:40,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:55:40,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:55:40,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:55:40,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:55:40,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:55:40,229 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:55:40,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:55:40,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:55:40,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:55:40,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:55:40,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:55:40,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:55:40,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:55:40,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:55:40,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:55:40,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:55:40,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:55:40,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:55:40,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:55:40,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:55:40,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:40,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:55:40,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:55:40,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:55:40,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:55:40,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:55:40,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:55:40,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:55:40,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:55:40,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:55:40,241 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 -> b7fe6678e6dee0757bbafd48f1956712f3f9f10de2405846c9036c2565c43ad1 [2024-10-13 03:55:40,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:55:40,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:55:40,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:55:40,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:55:40,590 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:55:40,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-24.i [2024-10-13 03:55:42,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:55:42,323 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:55:42,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-24.i [2024-10-13 03:55:42,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8409b7a60/f85468d334144f8b9f94afeccaf65d1a/FLAGfdde76131 [2024-10-13 03:55:42,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8409b7a60/f85468d334144f8b9f94afeccaf65d1a [2024-10-13 03:55:42,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:55:42,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:55:42,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:42,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:55:42,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:55:42,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47572136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42, skipping insertion in model container [2024-10-13 03:55:42,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:55:42,580 WARN L248 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_loopvsstraightlinecode_100-while_file-24.i[916,929] [2024-10-13 03:55:42,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:42,725 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:55:42,738 WARN L248 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_loopvsstraightlinecode_100-while_file-24.i[916,929] [2024-10-13 03:55:42,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:42,817 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:55:42,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42 WrapperNode [2024-10-13 03:55:42,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:42,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:42,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:55:42,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:55:42,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,886 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-10-13 03:55:42,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:42,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:55:42,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:55:42,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:55:42,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,942 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-10-13 03:55:42,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:55:42,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:55:42,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:55:42,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:55:42,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (1/1) ... [2024-10-13 03:55:42,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:55:43,033 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-10-13 03:55:43,037 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-10-13 03:55:43,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:55:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:55:43,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:55:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:55:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:55:43,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:55:43,210 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:55:43,212 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:55:43,641 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:55:43,641 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:55:43,734 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:55:43,736 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:55:43,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:43 BoogieIcfgContainer [2024-10-13 03:55:43,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:55:43,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:55:43,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:55:43,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:55:43,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:55:42" (1/3) ... [2024-10-13 03:55:43,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753eb040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:55:43, skipping insertion in model container [2024-10-13 03:55:43,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:42" (2/3) ... [2024-10-13 03:55:43,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753eb040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:55:43, skipping insertion in model container [2024-10-13 03:55:43,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:43" (3/3) ... [2024-10-13 03:55:43,756 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-24.i [2024-10-13 03:55:43,775 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:55:43,776 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:55:43,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:55:43,879 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;@7f71c020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:55:43,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:55:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:55:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 03:55:43,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:43,897 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:43,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -271627732, now seen corresponding path program 1 times [2024-10-13 03:55:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305921409] [2024-10-13 03:55:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:55:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:55:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 03:55:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:55:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:55:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:55:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:55:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:55:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:55:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:55:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:55:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:55:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:55:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:55:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:55:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:55:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:55:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:55:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:55:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:55:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:55:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:55:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:55:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:55:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:55:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 03:55:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:55:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:44,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305921409] [2024-10-13 03:55:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305921409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:55:44,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:55:44,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:55:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485522297] [2024-10-13 03:55:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:55:44,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:55:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:44,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:55:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:55:44,536 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:55:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:44,589 INFO L93 Difference]: Finished difference Result 145 states and 259 transitions. [2024-10-13 03:55:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:55:44,594 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2024-10-13 03:55:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:44,604 INFO L225 Difference]: With dead ends: 145 [2024-10-13 03:55:44,605 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 03:55:44,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-10-13 03:55:44,618 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:44,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:55:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 03:55:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 03:55:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:55:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2024-10-13 03:55:44,676 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 170 [2024-10-13 03:55:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2024-10-13 03:55:44,677 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:55:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2024-10-13 03:55:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 03:55:44,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:44,681 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:44,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:55:44,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1961327966, now seen corresponding path program 1 times [2024-10-13 03:55:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267726760] [2024-10-13 03:55:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:55:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:55:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 03:55:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:55:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:55:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:55:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:55:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:55:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:55:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:55:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:55:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:55:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:55:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:55:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:55:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:55:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:55:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:55:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:55:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:55:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:55:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:55:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:55:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:55:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:55:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 03:55:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 03:55:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267726760] [2024-10-13 03:55:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267726760] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:55:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399259536] [2024-10-13 03:55:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:45,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:55:45,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:55:45,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:55:45,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:55:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:46,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:55:46,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:55:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 386 proven. 66 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2024-10-13 03:55:46,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:55:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 03:55:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399259536] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:55:46,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:55:46,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 03:55:46,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083539273] [2024-10-13 03:55:46,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:55:46,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:55:46,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:46,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:55:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:55:46,838 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-13 03:55:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:47,121 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2024-10-13 03:55:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:55:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 170 [2024-10-13 03:55:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:47,124 INFO L225 Difference]: With dead ends: 151 [2024-10-13 03:55:47,124 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 03:55:47,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 03:55:47,126 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 118 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:47,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 169 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:55:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 03:55:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-10-13 03:55:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:55:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2024-10-13 03:55:47,151 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 170 [2024-10-13 03:55:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:47,152 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2024-10-13 03:55:47,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-13 03:55:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2024-10-13 03:55:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:55:47,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:47,158 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:47,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:55:47,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:55:47,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:47,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash -194517724, now seen corresponding path program 1 times [2024-10-13 03:55:47,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:47,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065562741] [2024-10-13 03:55:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:55:47,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:55:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:55:47,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:55:47,804 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:55:47,805 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:55:47,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:55:47,811 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 03:55:47,943 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:55:47,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:55:47 BoogieIcfgContainer [2024-10-13 03:55:47,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:55:47,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:55:47,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:55:47,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:55:47,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:43" (3/4) ... [2024-10-13 03:55:47,952 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:55:47,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:55:47,954 INFO L158 Benchmark]: Toolchain (without parser) took 5601.43ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 115.6MB in the beginning and 99.9MB in the end (delta: 15.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-13 03:55:47,954 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:55:47,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.22ms. Allocated memory is still 144.7MB. Free memory was 115.6MB in the beginning and 96.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:55:47,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.05ms. Allocated memory is still 144.7MB. Free memory was 96.8MB in the beginning and 92.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:55:47,955 INFO L158 Benchmark]: Boogie Preprocessor took 98.70ms. Allocated memory is still 144.7MB. Free memory was 92.7MB in the beginning and 85.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 03:55:47,956 INFO L158 Benchmark]: RCFGBuilder took 750.98ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 114.0MB in the end (delta: -28.8MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-10-13 03:55:47,956 INFO L158 Benchmark]: TraceAbstraction took 4203.36ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 114.0MB in the beginning and 101.0MB in the end (delta: 13.1MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-10-13 03:55:47,956 INFO L158 Benchmark]: Witness Printer took 6.87ms. Allocated memory is still 184.5MB. Free memory was 101.0MB in the beginning and 99.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:55:47,958 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.27ms. Allocated memory is still 104.9MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.22ms. Allocated memory is still 144.7MB. Free memory was 115.6MB in the beginning and 96.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.05ms. Allocated memory is still 144.7MB. Free memory was 96.8MB in the beginning and 92.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.70ms. Allocated memory is still 144.7MB. Free memory was 92.7MB in the beginning and 85.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 750.98ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 114.0MB in the end (delta: -28.8MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4203.36ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 114.0MB in the beginning and 101.0MB in the end (delta: 13.1MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 6.87ms. Allocated memory is still 184.5MB. Free memory was 101.0MB in the beginning and 99.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 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryArithmeticFLOAToperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.8; [L23] float var_1_5 = 10000000000.75; [L24] float var_1_6 = 50.5; [L25] float var_1_7 = 3.875; [L26] unsigned long int var_1_8 = 256; [L27] unsigned short int var_1_10 = 1; [L28] unsigned char var_1_11 = 1; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] unsigned char var_1_16 = 1; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 64; [L35] unsigned char var_1_19 = 2; [L36] unsigned long int var_1_20 = 64; [L37] signed char var_1_21 = 2; [L38] signed char var_1_22 = 8; [L39] signed char var_1_23 = 10; [L40] signed char var_1_24 = 10; [L41] signed char var_1_25 = 1; [L42] signed char var_1_26 = 10; [L43] unsigned char var_1_27 = 4; [L44] float var_1_28 = 32.5; [L45] float var_1_29 = 0.0; [L46] float var_1_30 = 127.5; [L47] float var_1_31 = 5.25; [L48] float var_1_32 = 9.4; [L49] float var_1_33 = 5.4; [L50] float var_1_34 = 0.5; [L51] unsigned char last_1_var_1_27 = 4; [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] CALL updateLastVariables() [L172] last_1_var_1_27 = var_1_27 [L182] RET updateLastVariables() [L183] CALL updateVariables() [L126] var_1_5 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_5 >= 0.0F && 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_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_6=101/2, var_1_7=31/8, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_6=101/2, var_1_7=31/8, var_1_8=256] [L127] RET assume_abort_if_not((var_1_5 >= 0.0F && 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_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_6=101/2, var_1_7=31/8, var_1_8=256] [L128] var_1_6 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_6 >= 0.0F && 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_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_7=31/8, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_7=31/8, var_1_8=256] [L129] RET assume_abort_if_not((var_1_6 >= 0.0F && 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_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_7=31/8, var_1_8=256] [L130] var_1_7 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L131] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L132] var_1_13 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L133] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L134] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L134] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L135] var_1_14 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L136] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L137] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L137] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L138] var_1_17 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L139] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L140] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L140] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=64, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L141] var_1_18 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_18 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L142] RET assume_abort_if_not(var_1_18 >= 63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L143] CALL assume_abort_if_not(var_1_18 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L143] RET assume_abort_if_not(var_1_18 <= 128) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=2, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L144] var_1_19 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L145] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L146] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L146] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=8, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L147] var_1_22 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L148] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L149] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L149] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=10, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L150] var_1_23 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_23 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L151] RET assume_abort_if_not(var_1_23 >= -63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L152] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L152] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L153] var_1_24 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L154] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L155] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L155] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L156] var_1_25 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L157] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L158] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L158] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=10, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L159] var_1_26 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L160] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L161] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L161] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_29=0, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L162] var_1_29 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L163] RET assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_30=255/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L164] var_1_30 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L165] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_32=47/5, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L166] var_1_32 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_32 >= -230584.3009213691390e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 2305843.009213691390e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L167] RET assume_abort_if_not((var_1_32 >= -230584.3009213691390e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 2305843.009213691390e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_33=27/5, var_1_34=1/2, var_1_8=256] [L168] var_1_33 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_33 >= -230584.3009213691390e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 2305843.009213691390e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_34=1/2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_34=1/2, var_1_8=256] [L169] RET assume_abort_if_not((var_1_33 >= -230584.3009213691390e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 2305843.009213691390e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=1, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_34=1/2, var_1_8=256] [L183] RET updateVariables() [L184] CALL step() [L55] var_1_10 = last_1_var_1_27 [L56] signed long int stepLocal_2 = (var_1_18 + 64) - var_1_19; VAL [isInitial=1, last_1_var_1_27=4, stepLocal_2=123, var_1_10=4, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_34=1/2, var_1_8=256] [L57] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_27=4, stepLocal_2=123, var_1_10=4, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_34=1/2, var_1_8=256] [L60] COND TRUE var_1_10 <= stepLocal_2 [L61] var_1_16 = var_1_14 VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=65/2, var_1_31=21/4, var_1_34=1/2, var_1_8=256] [L66] COND TRUE \read(var_1_16) [L67] var_1_28 = ((((var_1_7) > (24.8f)) ? (var_1_7) : (24.8f))) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_31=21/4, var_1_34=1/2, var_1_7=124/5, var_1_8=256] [L71] COND TRUE ((1.5899999999999999 * var_1_5) * (var_1_28 / 9.5)) <= var_1_6 [L72] var_1_27 = var_1_19 VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=1, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_31=21/4, var_1_34=1/2, var_1_7=124/5, var_1_8=256] [L74] COND TRUE \read(var_1_16) [L75] var_1_11 = (var_1_16 && var_1_13) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_31=21/4, var_1_34=1/2, var_1_7=124/5, var_1_8=256] [L79] COND TRUE (var_1_5 * var_1_28) < var_1_7 [L80] var_1_15 = ((var_1_11 && var_1_13) || (! var_1_14)) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=2, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_31=21/4, var_1_34=1/2, var_1_7=124/5, var_1_8=256] [L84] var_1_21 = ((((((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))) < 0 ) ? -((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))) : ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) + (((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))) - var_1_26)) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_31=21/4, var_1_34=1/2, var_1_7=124/5, var_1_8=256] [L85] COND TRUE var_1_10 <= var_1_21 [L86] var_1_31 = ((var_1_32 + var_1_33) + ((((var_1_7) > (var_1_30)) ? (var_1_7) : (var_1_30)))) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_34=1/2, var_1_7=124/5, var_1_8=256] [L94] COND FALSE !((- 3.75) < var_1_29) [L97] var_1_34 = ((((var_1_30) < (8.75f)) ? (var_1_30) : (8.75f))) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=256] [L99] unsigned short int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_27=4, stepLocal_0=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_1=4/5, var_1_20=64, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=256] [L100] COND TRUE var_1_27 <= stepLocal_0 [L101] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_20=64, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=256] [L105] COND FALSE !(var_1_10 > var_1_27) [L112] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_20=4, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=256] [L114] unsigned char stepLocal_1 = var_1_27; VAL [isInitial=1, last_1_var_1_27=4, stepLocal_1=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_20=4, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=256] [L115] COND FALSE !(var_1_5 >= var_1_6) [L122] var_1_8 = var_1_27 VAL [isInitial=1, last_1_var_1_27=4, stepLocal_1=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_20=4, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=4] [L184] RET step() [L185] CALL, EXPR property() [L175-L176] return ((((((((((((var_1_27 <= var_1_10) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : (var_1_1 == ((float) (10.5f + var_1_7)))) && ((var_1_5 >= var_1_6) ? ((var_1_27 < var_1_20) ? (var_1_8 == ((unsigned long int) (((((var_1_20 + ((((var_1_27) > (var_1_10)) ? (var_1_27) : (var_1_10))))) > (1u)) ? ((var_1_20 + ((((var_1_27) > (var_1_10)) ? (var_1_27) : (var_1_10))))) : (1u))))) : (var_1_8 == ((unsigned long int) var_1_10))) : (var_1_8 == ((unsigned long int) var_1_27)))) && (var_1_10 == ((unsigned short int) last_1_var_1_27))) && (var_1_16 ? (var_1_11 == ((unsigned char) (var_1_16 && var_1_13))) : (var_1_11 == ((unsigned char) ((! var_1_13) && var_1_14))))) && (((var_1_5 * var_1_28) < var_1_7) ? (var_1_15 == ((unsigned char) ((var_1_11 && var_1_13) || (! var_1_14)))) : (var_1_15 == ((unsigned char) (! var_1_13))))) && (var_1_13 ? (var_1_16 == ((unsigned char) (var_1_14 && var_1_17))) : ((var_1_10 <= ((var_1_18 + 64) - var_1_19)) ? (var_1_16 == ((unsigned char) var_1_14)) : (var_1_16 == ((unsigned char) var_1_14))))) && ((var_1_10 > var_1_27) ? (((var_1_19 << 1) > (var_1_10 - (var_1_27 + var_1_27))) ? (var_1_20 == ((unsigned long int) (((((((var_1_18) < (2u)) ? (var_1_18) : (2u))) < 0 ) ? -((((var_1_18) < (2u)) ? (var_1_18) : (2u))) : ((((var_1_18) < (2u)) ? (var_1_18) : (2u))))))) : (var_1_20 == ((unsigned long int) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19)))))) : (var_1_20 == ((unsigned long int) var_1_19)))) && (var_1_21 == ((signed char) ((((((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))) < 0 ) ? -((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))) : ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) + (((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))) - var_1_26))))) && ((((1.5899999999999999 * var_1_5) * (var_1_28 / 9.5)) <= var_1_6) ? (var_1_27 == ((unsigned char) var_1_19)) : 1)) && (var_1_16 ? (var_1_28 == ((float) ((((var_1_7) > (24.8f)) ? (var_1_7) : (24.8f))))) : (var_1_28 == ((float) (((((((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))) - (var_1_29 - var_1_30))) < (var_1_7)) ? ((((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))) - (var_1_29 - var_1_30))) : (var_1_7))))))) && ((var_1_10 <= var_1_21) ? (var_1_31 == ((float) ((var_1_32 + var_1_33) + ((((var_1_7) > (var_1_30)) ? (var_1_7) : (var_1_30)))))) : ((var_1_10 >= (((((var_1_18 + var_1_26)) < (25)) ? ((var_1_18 + var_1_26)) : (25)))) ? (var_1_31 == ((float) (var_1_32 + ((((((((var_1_33) < (var_1_30)) ? (var_1_33) : (var_1_30)))) < (var_1_7)) ? (((((var_1_33) < (var_1_30)) ? (var_1_33) : (var_1_30)))) : (var_1_7)))))) : (var_1_31 == ((float) (32.5f - (64.4f + var_1_30))))))) && (((- 3.75) < var_1_29) ? (var_1_34 == ((float) (((((((var_1_30 - var_1_29) < 0 ) ? -(var_1_30 - var_1_29) : (var_1_30 - var_1_29))) < 0 ) ? -((((var_1_30 - var_1_29) < 0 ) ? -(var_1_30 - var_1_29) : (var_1_30 - var_1_29))) : ((((var_1_30 - var_1_29) < 0 ) ? -(var_1_30 - var_1_29) : (var_1_30 - var_1_29))))))) : (var_1_34 == ((float) ((((var_1_30) < (8.75f)) ? (var_1_30) : (8.75f)))))) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_20=4, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_27=4, var_1_10=4, var_1_11=0, var_1_13=0, var_1_14=-255, var_1_15=0, var_1_16=-255, var_1_17=0, var_1_18=63, var_1_19=4, var_1_20=4, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=4, var_1_25=3, var_1_26=0, var_1_27=4, var_1_28=124/5, var_1_30=35/4, var_1_34=35/4, var_1_7=124/5, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 3, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 184 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 483 GetRequests, 473 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 681 NumberOfCodeBlocks, 681 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1518 SizeOfPredicates, 1 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 5418/5616 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-10-13 03:55:47,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-24.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 b7fe6678e6dee0757bbafd48f1956712f3f9f10de2405846c9036c2565c43ad1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:55:50,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:55:50,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:55:50,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:55:50,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:55:50,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:55:50,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:55:50,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:55:50,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:55:50,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:55:50,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:55:50,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:55:50,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:55:50,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:55:50,387 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:55:50,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:55:50,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:55:50,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:55:50,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:55:50,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:55:50,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:55:50,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:55:50,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:55:50,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:55:50,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:55:50,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:55:50,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:55:50,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:55:50,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:55:50,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:55:50,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:55:50,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:55:50,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:55:50,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:55:50,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:50,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:55:50,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:55:50,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:55:50,399 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:55:50,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:55:50,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:55:50,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:55:50,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:55:50,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:55:50,400 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:55:50,401 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 -> b7fe6678e6dee0757bbafd48f1956712f3f9f10de2405846c9036c2565c43ad1 [2024-10-13 03:55:50,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:55:50,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:55:50,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:55:50,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:55:50,777 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:55:50,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-24.i [2024-10-13 03:55:52,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:55:52,455 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:55:52,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-24.i [2024-10-13 03:55:52,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1bb7d1c/65f81117b0a14be9914fe107831bd137/FLAG6b1e4e1bb [2024-10-13 03:55:52,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1bb7d1c/65f81117b0a14be9914fe107831bd137 [2024-10-13 03:55:52,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:55:52,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:55:52,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:52,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:55:52,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:55:52,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:52" (1/1) ... [2024-10-13 03:55:52,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef6f3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:52, skipping insertion in model container [2024-10-13 03:55:52,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:52" (1/1) ... [2024-10-13 03:55:52,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:55:53,056 WARN L248 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_loopvsstraightlinecode_100-while_file-24.i[916,929] [2024-10-13 03:55:53,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:53,177 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:55:53,190 WARN L248 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_loopvsstraightlinecode_100-while_file-24.i[916,929] [2024-10-13 03:55:53,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:53,261 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:55:53,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53 WrapperNode [2024-10-13 03:55:53,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:53,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:53,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:55:53,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:55:53,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,340 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-13 03:55:53,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:53,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:55:53,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:55:53,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:55:53,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,383 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-10-13 03:55:53,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:55:53,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:55:53,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:55:53,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:55:53,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (1/1) ... [2024-10-13 03:55:53,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:53,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:55:53,479 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-10-13 03:55:53,485 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-10-13 03:55:53,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:55:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:55:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:55:53,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:55:53,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:55:53,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:55:53,646 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:55:53,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:56:09,552 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:56:09,554 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:56:09,607 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:56:09,608 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:56:09,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:56:09 BoogieIcfgContainer [2024-10-13 03:56:09,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:56:09,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:56:09,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:56:09,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:56:09,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:55:52" (1/3) ... [2024-10-13 03:56:09,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1133ac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:56:09, skipping insertion in model container [2024-10-13 03:56:09,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:53" (2/3) ... [2024-10-13 03:56:09,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1133ac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:56:09, skipping insertion in model container [2024-10-13 03:56:09,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:56:09" (3/3) ... [2024-10-13 03:56:09,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-24.i [2024-10-13 03:56:09,636 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:56:09,637 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:56:09,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:56:09,714 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;@4b525c5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:56:09,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:56:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:56:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 03:56:09,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:09,741 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:09,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash -271627732, now seen corresponding path program 1 times [2024-10-13 03:56:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:09,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604427735] [2024-10-13 03:56:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:09,769 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-10-13 03:56:09,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:09,773 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-10-13 03:56:09,775 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-10-13 03:56:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:10,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:56:10,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2024-10-13 03:56:10,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:56:10,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604427735] [2024-10-13 03:56:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604427735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:10,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:56:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527683059] [2024-10-13 03:56:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:10,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:56:10,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:56:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:56:11,017 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:56:15,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:56:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:15,532 INFO L93 Difference]: Finished difference Result 145 states and 259 transitions. [2024-10-13 03:56:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:56:15,680 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2024-10-13 03:56:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:15,686 INFO L225 Difference]: With dead ends: 145 [2024-10-13 03:56:15,687 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 03:56:15,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:56:15,693 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:15,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-13 03:56:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 03:56:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 03:56:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:56:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2024-10-13 03:56:15,756 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 170 [2024-10-13 03:56:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:15,758 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2024-10-13 03:56:15,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:56:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2024-10-13 03:56:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 03:56:15,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:15,765 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:15,806 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-10-13 03:56:15,966 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-10-13 03:56:15,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1961327966, now seen corresponding path program 1 times [2024-10-13 03:56:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781646156] [2024-10-13 03:56:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:15,969 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-10-13 03:56:15,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:15,972 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-10-13 03:56:15,974 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-10-13 03:56:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:16,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:56:16,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 386 proven. 66 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2024-10-13 03:56:22,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:56:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 03:56:26,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781646156] [2024-10-13 03:56:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781646156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:56:26,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:56:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 03:56:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099795850] [2024-10-13 03:56:26,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:56:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:56:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:56:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:56:26,801 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-13 03:56:35,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:56:39,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:56:43,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:56:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:43,585 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2024-10-13 03:56:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:56:43,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 170 [2024-10-13 03:56:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:43,755 INFO L225 Difference]: With dead ends: 151 [2024-10-13 03:56:43,755 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 03:56:43,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 03:56:43,758 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:43,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 169 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 16.2s Time] [2024-10-13 03:56:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 03:56:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-10-13 03:56:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:56:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2024-10-13 03:56:43,780 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 170 [2024-10-13 03:56:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:43,781 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2024-10-13 03:56:43,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-13 03:56:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2024-10-13 03:56:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:56:43,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:43,784 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:43,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:56:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:56:43,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash -194517724, now seen corresponding path program 1 times [2024-10-13 03:56:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:43,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568746330] [2024-10-13 03:56:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:43,987 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-10-13 03:56:43,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:43,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:56:43,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:56:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:45,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 03:56:45,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 348 proven. 9 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-10-13 03:56:54,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:57:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 69 proven. 9 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 03:57:02,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:57:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568746330] [2024-10-13 03:57:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568746330] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:57:02,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:57:02,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 03:57:02,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593881410] [2024-10-13 03:57:02,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:57:02,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:57:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:57:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:57:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:57:02,397 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54)