./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-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:23:01,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:23:01,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:23:01,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:23:01,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:23:01,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:23:01,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:23:01,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:23:01,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:23:01,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:23:01,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:23:01,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:23:01,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:23:01,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:23:01,338 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:23:01,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:23:01,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:23:01,339 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:23:01,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:23:01,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:23:01,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:23:01,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:23:01,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:23:01,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:23:01,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:23:01,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:23:01,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:23:01,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:23:01,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:23:01,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:23:01,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:23:01,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:23:01,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:01,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:23:01,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:23:01,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:23:01,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:23:01,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:23:01,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:23:01,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:23:01,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:23:01,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:23:01,346 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-clean/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-clean/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 -> 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee [2024-10-11 11:23:01,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:23:01,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:23:01,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:23:01,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:23:01,552 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:23:01,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2024-10-11 11:23:02,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:23:02,979 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:23:02,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2024-10-11 11:23:02,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dd0af12b/b23de982eba24f9ca58a1b0a378b4d3c/FLAGad7109835 [2024-10-11 11:23:02,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dd0af12b/b23de982eba24f9ca58a1b0a378b4d3c [2024-10-11 11:23:03,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:23:03,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:23:03,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:03,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:23:03,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:23:03,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afc65c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03, skipping insertion in model container [2024-10-11 11:23:03,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:23:03,169 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-91.i[916,929] [2024-10-11 11:23:03,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:03,315 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:23:03,323 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-91.i[916,929] [2024-10-11 11:23:03,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:03,377 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:23:03,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03 WrapperNode [2024-10-11 11:23:03,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:03,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:03,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:23:03,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:23:03,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,443 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-11 11:23:03,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:03,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:23:03,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:23:03,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:23:03,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,493 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-11 11:23:03,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:23:03,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:23:03,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:23:03,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:23:03,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (1/1) ... [2024-10-11 11:23:03,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:03,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:23:03,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:23:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:23:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:23:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:23:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:23:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:23:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:23:03,660 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:23:03,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:23:04,033 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 11:23:04,033 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:23:04,087 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:23:04,090 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:23:04,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:04 BoogieIcfgContainer [2024-10-11 11:23:04,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:23:04,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:23:04,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:23:04,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:23:04,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:23:03" (1/3) ... [2024-10-11 11:23:04,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b30c109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:04, skipping insertion in model container [2024-10-11 11:23:04,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:03" (2/3) ... [2024-10-11 11:23:04,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b30c109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:04, skipping insertion in model container [2024-10-11 11:23:04,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:04" (3/3) ... [2024-10-11 11:23:04,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-91.i [2024-10-11 11:23:04,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:23:04,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:23:04,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:23:04,172 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;@2d3eadb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:23:04,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:23:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:23:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:23:04,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:04,193 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:23:04,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:04,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash -958928217, now seen corresponding path program 1 times [2024-10-11 11:23:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:04,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274662534] [2024-10-11 11:23:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:23:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:23:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:23:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:23:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:23:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:23:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:23:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:23:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:23:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:23:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:23:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:23:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:23:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:23:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:23:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:23:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:23:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:23:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:23:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:23:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:23:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:23:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:23:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:23:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:23:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:23:04,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274662534] [2024-10-11 11:23:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274662534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:04,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:04,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:23:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190056670] [2024-10-11 11:23:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:04,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:23:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:04,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:23:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:23:04,586 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:23:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:04,627 INFO L93 Difference]: Finished difference Result 147 states and 259 transitions. [2024-10-11 11:23:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:23:04,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-11 11:23:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:04,636 INFO L225 Difference]: With dead ends: 147 [2024-10-11 11:23:04,637 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 11:23:04,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-11 11:23:04,641 INFO L432 NwaCegarLoop]: 110 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, 110 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-11 11:23:04,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:23:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 11:23:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 11:23:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:23:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-11 11:23:04,672 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 161 [2024-10-11 11:23:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:04,672 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-11 11:23:04,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:23:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-11 11:23:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:23:04,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:04,675 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:23:04,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:23:04,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash -675495451, now seen corresponding path program 1 times [2024-10-11 11:23:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931909367] [2024-10-11 11:23:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:23:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:23:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:23:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:23:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:23:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:23:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:23:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:23:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:23:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:23:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:23:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:23:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:23:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:23:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:23:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:23:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:23:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:23:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:23:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:23:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:23:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:23:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:23:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:23:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:23:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:23:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931909367] [2024-10-11 11:23:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931909367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:23:05,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402377710] [2024-10-11 11:23:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:05,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:23:05,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:23:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:05,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 11:23:05,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 684 proven. 9 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-10-11 11:23:05,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:23:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:23:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402377710] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:23:06,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:23:06,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2024-10-11 11:23:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736488906] [2024-10-11 11:23:06,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:23:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 11:23:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:06,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 11:23:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-11 11:23:06,137 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-10-11 11:23:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:07,136 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2024-10-11 11:23:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 11:23:07,137 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 161 [2024-10-11 11:23:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:07,139 INFO L225 Difference]: With dead ends: 269 [2024-10-11 11:23:07,139 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 11:23:07,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=990, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 11:23:07,141 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 324 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:07,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 416 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 11:23:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 11:23:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2024-10-11 11:23:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 72 states have internal predecessors, (86), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 11:23:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2024-10-11 11:23:07,176 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 161 [2024-10-11 11:23:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:07,176 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2024-10-11 11:23:07,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-10-11 11:23:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2024-10-11 11:23:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:23:07,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:07,178 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:23:07,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:23:07,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:07,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:07,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 991842013, now seen corresponding path program 1 times [2024-10-11 11:23:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:07,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535009688] [2024-10-11 11:23:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:07,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:23:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:23:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:23:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:23:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:23:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:23:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:23:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:23:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:23:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:23:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:23:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:23:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:23:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:23:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:23:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:23:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:23:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:23:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:23:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:23:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:23:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:23:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:23:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:23:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:23:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:23:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535009688] [2024-10-11 11:23:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535009688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:23:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202243557] [2024-10-11 11:23:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:08,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:08,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:23:08,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:23:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:08,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 11:23:08,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-11 11:23:08,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:23:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:23:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202243557] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:23:08,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:23:08,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-11 11:23:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531563528] [2024-10-11 11:23:08,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:23:08,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:23:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:23:08,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:23:08,584 INFO L87 Difference]: Start difference. First operand 123 states and 178 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 11:23:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:09,382 INFO L93 Difference]: Finished difference Result 408 states and 558 transitions. [2024-10-11 11:23:09,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 11:23:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 162 [2024-10-11 11:23:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:09,386 INFO L225 Difference]: With dead ends: 408 [2024-10-11 11:23:09,386 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 11:23:09,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 369 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 11:23:09,388 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 269 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:09,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 840 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:23:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 11:23:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 222. [2024-10-11 11:23:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.1764705882352942) internal successors, (160), 137 states have internal predecessors, (160), 71 states have call successors, (71), 14 states have call predecessors, (71), 14 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 11:23:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 302 transitions. [2024-10-11 11:23:09,434 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 302 transitions. Word has length 162 [2024-10-11 11:23:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:09,436 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 302 transitions. [2024-10-11 11:23:09,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 11:23:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 302 transitions. [2024-10-11 11:23:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:23:09,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:09,441 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:23:09,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:23:09,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:09,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:09,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1049100315, now seen corresponding path program 1 times [2024-10-11 11:23:09,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:09,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961265692] [2024-10-11 11:23:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:23:09,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1239541220] [2024-10-11 11:23:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:09,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:23:09,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:23:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:23:09,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:23:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:23:10,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:23:10,090 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:23:10,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:23:10,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 11:23:10,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:10,297 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 11:23:10,378 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:23:10,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:23:10 BoogieIcfgContainer [2024-10-11 11:23:10,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:23:10,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:23:10,380 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:23:10,380 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:23:10,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:04" (3/4) ... [2024-10-11 11:23:10,382 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:23:10,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:23:10,383 INFO L158 Benchmark]: Toolchain (without parser) took 7381.72ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 98.4MB in the beginning and 196.6MB in the end (delta: -98.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:23:10,383 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 130.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:23:10,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.38ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 132.0MB in the end (delta: -33.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:23:10,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.84ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 124.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:23:10,384 INFO L158 Benchmark]: Boogie Preprocessor took 76.67ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 107.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:23:10,384 INFO L158 Benchmark]: RCFGBuilder took 567.87ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 129.9MB in the end (delta: -22.4MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-10-11 11:23:10,384 INFO L158 Benchmark]: TraceAbstraction took 6286.58ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 128.9MB in the beginning and 196.6MB in the end (delta: -67.6MB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. [2024-10-11 11:23:10,384 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 251.7MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:23:10,385 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.14ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 130.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.38ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 132.0MB in the end (delta: -33.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.84ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 124.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.67ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 107.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 567.87ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 129.9MB in the end (delta: -22.4MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6286.58ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 128.9MB in the beginning and 196.6MB in the end (delta: -67.6MB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 251.7MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 177. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 16; [L25] unsigned char var_1_6 = 16; [L26] signed short int var_1_7 = -8; [L27] signed char var_1_9 = 0; [L28] signed char var_1_10 = -4; [L29] double var_1_11 = 2.25; [L30] double var_1_12 = 199.3; [L31] double var_1_13 = 7.2; [L32] unsigned long int var_1_14 = 10; [L33] signed short int var_1_15 = -4; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_19 = 256; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = -1; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] unsigned short int var_1_25 = 100; [L42] double var_1_26 = 15.125; [L43] double var_1_27 = 2.3; [L44] double var_1_28 = 999.25; [L45] double var_1_29 = 1.75; [L46] unsigned short int var_1_30 = 43183; [L47] unsigned long int var_1_31 = 100000; [L48] double var_1_32 = 7.4; [L49] double var_1_33 = 31.125; [L50] signed short int var_1_34 = -128; [L51] signed char var_1_35 = -1; [L52] signed char last_1_var_1_9 = 0; [L53] signed short int last_1_var_1_19 = 256; [L54] unsigned long int last_1_var_1_31 = 100000; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L172] last_1_var_1_9 = var_1_9 [L173] last_1_var_1_19 = var_1_19 [L174] last_1_var_1_31 = var_1_31 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_6=16, var_1_7=-8, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=16, var_1_7=-8, var_1_9=0] [L136] var_1_6 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_7=-8, var_1_9=0] [L137] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_7=-8, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L138] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L145] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L148] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L158] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L159] var_1_28 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L160] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L161] var_1_29 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L162] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L163] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L164] var_1_30 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L165] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L166] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L167] var_1_33 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L168] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_33 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L169] RET assume_abort_if_not(var_1_33 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L185] RET updateVariables() [L186] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_0=256, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L59] COND TRUE last_1_var_1_31 != stepLocal_0 [L60] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L64] var_1_34 = var_1_1 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L65] COND TRUE var_1_10 == var_1_34 [L66] var_1_20 = (var_1_6 + var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L68] var_1_14 = ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1))) [L69] unsigned char stepLocal_4 = var_1_28 == (var_1_27 + var_1_29); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_4=1, var_1_10=125, var_1_11=9/4, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L70] COND FALSE !((var_1_1 > var_1_30) && stepLocal_4) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L73] COND FALSE !((var_1_29 / var_1_33) <= (- (var_1_12 + 10.1))) [L76] var_1_32 = var_1_26 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=9/4, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L79] unsigned long int stepLocal_2 = var_1_14 - var_1_5; [L80] unsigned long int stepLocal_1 = (((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4))); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_1=0, stepLocal_2=125, var_1_10=125, var_1_11=9/4, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=0] [L81] COND FALSE !(stepLocal_1 < (last_1_var_1_9 * (var_1_6 + var_1_20))) [L86] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=9/4, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=125] [L88] COND FALSE !(! var_1_24) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=9/4, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=-8, var_1_9=125] [L91] var_1_7 = ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=9/4, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L92] COND TRUE ((var_1_10 / var_1_4) / 1) <= var_1_1 [L93] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=-1, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L95] var_1_35 = var_1_10 [L96] var_1_21 = (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L97] COND FALSE !(var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) [L104] var_1_25 = (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L106] unsigned char stepLocal_3 = var_1_13 < (var_1_32 * var_1_12); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, stepLocal_3=0, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L107] COND FALSE !(stepLocal_3 && var_1_16) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L110] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L117] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=125, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return (((((((((((((((last_1_var_1_31 != last_1_var_1_19) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (((((50) > (var_1_5)) ? (50) : (var_1_5))) + var_1_6)))) && (var_1_7 == ((signed short int) ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1)))))) && ((((((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4)))) < (last_1_var_1_9 * (var_1_6 + var_1_20))) ? ((var_1_20 < (var_1_14 - var_1_5)) ? (var_1_9 == ((signed char) var_1_10)) : 1) : (var_1_9 == ((signed char) var_1_10)))) && ((((var_1_10 / var_1_4) / 1) <= var_1_1) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (var_1_14 == ((unsigned long int) ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1)))))) && (var_1_22 ? (var_1_22 ? (var_1_15 == ((signed short int) ((((((((var_1_9) > (1000)) ? (var_1_9) : (1000))) < 0 ) ? -((((var_1_9) > (1000)) ? (var_1_9) : (1000))) : ((((var_1_9) > (1000)) ? (var_1_9) : (1000))))) + var_1_4))) : (var_1_15 == ((signed short int) ((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9)))))) : 1)) && (var_1_22 ? ((var_1_20 > var_1_15) ? (var_1_19 == ((signed short int) (var_1_34 + var_1_10))) : ((var_1_15 < var_1_4) ? (var_1_19 == ((signed short int) var_1_4)) : (var_1_19 == ((signed short int) var_1_5)))) : 1)) && ((var_1_10 == var_1_34) ? (var_1_20 == ((unsigned char) (var_1_6 + var_1_5))) : 1)) && (var_1_21 == ((signed long int) (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20))))))) && (((var_1_13 < (var_1_32 * var_1_12)) && var_1_16) ? (var_1_22 == ((unsigned char) (var_1_23 && var_1_24))) : 1)) && ((var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (((var_1_13 / var_1_29) < var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_25 == ((unsigned short int) (((((var_1_14 + var_1_20)) < (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))) ? ((var_1_14 + var_1_20)) : (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))))))) : (var_1_25 == ((unsigned short int) (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))))))) && ((! var_1_24) ? (var_1_31 == ((unsigned long int) (var_1_34 + ((((var_1_20) < (var_1_6)) ? (var_1_20) : (var_1_6)))))) : 1)) && (((var_1_1 > var_1_30) && (var_1_28 == (var_1_27 + var_1_29))) ? (var_1_32 == ((double) ((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) : (((var_1_29 / var_1_33) <= (- (var_1_12 + 10.1))) ? (var_1_32 == ((double) var_1_26)) : (var_1_32 == ((double) var_1_26))))) && (var_1_34 == ((signed short int) var_1_1))) && (var_1_35 == ((signed char) var_1_10)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=125, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=127, var_1_15=-4, var_1_16=-255, var_1_19=256, var_1_1=125, var_1_20=129, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=125, var_1_35=125, var_1_4=-385, var_1_5=-254, var_1_6=383, var_1_7=2, var_1_9=125] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 1366 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 906 mSDsCounter, 447 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1537 IncrementalHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 447 mSolverCounterUnsat, 460 mSDtfsCounter, 1537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 809 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=3, InterpolantAutomatonStates: 60, 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, 3 MinimizatonAttempts, 176 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1123 ConstructedInterpolants, 0 QuantifiedInterpolants, 3332 SizeOfPredicates, 9 NumberOfNonLiveVariables, 785 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 8244/8400 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-11 11:23:10,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:23:12,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:23:12,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:23:12,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:23:12,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:23:12,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:23:12,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:23:12,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:23:12,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:23:12,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:23:12,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:23:12,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:23:12,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:23:12,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:23:12,252 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:23:12,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:23:12,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:23:12,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:23:12,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:23:12,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:23:12,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:23:12,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:23:12,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:23:12,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:23:12,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:23:12,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:23:12,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:23:12,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:23:12,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:23:12,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:23:12,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:23:12,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:23:12,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:23:12,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:23:12,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:12,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:23:12,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:23:12,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:23:12,259 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:23:12,260 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:23:12,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:23:12,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:23:12,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:23:12,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:23:12,261 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:23:12,261 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-clean/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-clean/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 -> 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee [2024-10-11 11:23:12,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:23:12,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:23:12,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:23:12,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:23:12,518 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:23:12,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2024-10-11 11:23:13,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:23:13,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:23:13,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2024-10-11 11:23:13,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3073643e/39f04770ac944689b53da4077a6cb506/FLAG43e14138d [2024-10-11 11:23:13,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3073643e/39f04770ac944689b53da4077a6cb506 [2024-10-11 11:23:13,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:23:13,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:23:13,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:13,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:23:13,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:23:13,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:13" (1/1) ... [2024-10-11 11:23:13,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d310dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:13, skipping insertion in model container [2024-10-11 11:23:13,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:13" (1/1) ... [2024-10-11 11:23:13,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:23:14,120 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-91.i[916,929] [2024-10-11 11:23:14,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:14,209 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:23:14,221 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-91.i[916,929] [2024-10-11 11:23:14,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:14,287 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:23:14,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14 WrapperNode [2024-10-11 11:23:14,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:14,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:14,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:23:14,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:23:14,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,346 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-11 11:23:14,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:14,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:23:14,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:23:14,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:23:14,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,384 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-11 11:23:14,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:23:14,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:23:14,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:23:14,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:23:14,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (1/1) ... [2024-10-11 11:23:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:14,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:23:14,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:23:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:23:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:23:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:23:14,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:23:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:23:14,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:23:14,579 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:23:14,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:23:41,386 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 11:23:41,386 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:23:41,426 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:23:41,427 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:23:41,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:41 BoogieIcfgContainer [2024-10-11 11:23:41,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:23:41,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:23:41,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:23:41,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:23:41,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:23:13" (1/3) ... [2024-10-11 11:23:41,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290023ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:41, skipping insertion in model container [2024-10-11 11:23:41,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:14" (2/3) ... [2024-10-11 11:23:41,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290023ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:41, skipping insertion in model container [2024-10-11 11:23:41,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:41" (3/3) ... [2024-10-11 11:23:41,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-91.i [2024-10-11 11:23:41,452 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:23:41,453 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:23:41,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:23:41,505 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;@3ca80fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:23:41,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:23:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:23:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:23:41,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:41,521 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:23:41,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:41,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -958928217, now seen corresponding path program 1 times [2024-10-11 11:23:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:23:41,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793496129] [2024-10-11 11:23:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:41,534 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-11 11:23:41,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:23:41,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 11:23:41,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:23:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:42,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:23:42,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-10-11 11:23:42,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:23:42,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:23:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793496129] [2024-10-11 11:23:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793496129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:23:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327564564] [2024-10-11 11:23:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:23:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:23:42,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:23:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:23:42,624 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:23:46,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:46,995 INFO L93 Difference]: Finished difference Result 147 states and 259 transitions. [2024-10-11 11:23:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:23:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-11 11:23:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:47,117 INFO L225 Difference]: With dead ends: 147 [2024-10-11 11:23:47,117 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 11:23:47,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:23:47,122 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:47,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 11:23:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 11:23:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 11:23:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:23:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-11 11:23:47,154 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 161 [2024-10-11 11:23:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:47,154 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-11 11:23:47,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:23:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-11 11:23:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:23:47,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:47,157 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:23:47,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:23:47,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 11:23:47,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:47,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -675495451, now seen corresponding path program 1 times [2024-10-11 11:23:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:23:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538562968] [2024-10-11 11:23:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:47,360 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-11 11:23:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:23:47,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 11:23:47,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:23:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:48,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:23:48,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-10-11 11:23:49,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:23:49,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:23:49,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538562968] [2024-10-11 11:23:49,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538562968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:23:49,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [135313078] [2024-10-11 11:23:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:49,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:23:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:23:49,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:23:49,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 11:23:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:51,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 11:23:51,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-10-11 11:23:52,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:23:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [135313078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:23:52,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:23:52,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 11:23:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030082164] [2024-10-11 11:23:52,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:23:52,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:23:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:23:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:23:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:23:52,977 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:24:00,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:24:04,749 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-11 11:24:08,757 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-11 11:24:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:24:08,763 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2024-10-11 11:24:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:24:08,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-11 11:24:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:24:08,884 INFO L225 Difference]: With dead ends: 151 [2024-10-11 11:24:08,885 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 11:24:08,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:24:08,886 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 73 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:24:08,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 192 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 15.4s Time] [2024-10-11 11:24:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 11:24:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-11 11:24:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:24:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-10-11 11:24:08,898 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 161 [2024-10-11 11:24:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:24:08,898 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-10-11 11:24:08,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:24:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-10-11 11:24:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:24:08,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:24:08,900 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:24:08,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:24:09,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:24:09,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 11:24:09,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:24:09,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:24:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash 733676575, now seen corresponding path program 1 times [2024-10-11 11:24:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:24:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914026650] [2024-10-11 11:24:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:24:09,303 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-11 11:24:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:24:09,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 11:24:09,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 11:24:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:24:10,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:24:10,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:24:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-11 11:24:13,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:24:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:24:16,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:24:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914026650] [2024-10-11 11:24:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914026650] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:24:16,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:24:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 11:24:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873427645] [2024-10-11 11:24:16,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:24:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:24:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:24:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:24:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:24:16,142 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:24:23,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:24:27,052 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-11 11:24:31,061 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-11 11:24:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:24:32,569 INFO L93 Difference]: Finished difference Result 184 states and 273 transitions. [2024-10-11 11:24:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:24:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 162 [2024-10-11 11:24:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:24:32,573 INFO L225 Difference]: With dead ends: 184 [2024-10-11 11:24:32,573 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 11:24:32,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:24:32,576 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 57 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:24:32,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 240 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2024-10-11 11:24:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 11:24:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2024-10-11 11:24:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:24:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2024-10-11 11:24:32,593 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 162 [2024-10-11 11:24:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:24:32,595 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2024-10-11 11:24:32,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:24:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2024-10-11 11:24:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:24:32,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:24:32,600 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:24:32,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 11:24:32,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 11:24:32,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:24:32,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:24:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash 991842013, now seen corresponding path program 1 times [2024-10-11 11:24:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:24:32,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556155289] [2024-10-11 11:24:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:24:32,802 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-11 11:24:32,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:24:32,803 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 11:24:32,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 11:24:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:24:34,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:24:34,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:24:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 680 proven. 63 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-10-11 11:24:40,453 INFO L311 TraceCheckSpWp]: Computing backward predicates...