./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-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0119f4ac8e4474ee05349e3ca0ec6dedfa1ab2168a7e9ac9d3b19942a2e0f51d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:20:30,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:20:30,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:20:30,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:20:30,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:20:30,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:20:30,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:20:30,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:20:30,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:20:30,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:20:30,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:20:30,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:20:30,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:20:30,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:20:30,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:20:30,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:20:30,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:20:30,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:20:30,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:20:30,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:20:30,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:20:30,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:20:30,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:20:30,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:20:30,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:20:30,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:20:30,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:20:30,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:20:30,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:20:30,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:20:30,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:20:30,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:20:30,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:30,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:20:30,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:20:30,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:20:30,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:20:30,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:20:30,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:20:30,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:20:30,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:20:30,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:20:30,824 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0119f4ac8e4474ee05349e3ca0ec6dedfa1ab2168a7e9ac9d3b19942a2e0f51d [2024-11-20 06:20:31,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:20:31,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:20:31,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:20:31,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:20:31,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:20:31,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i [2024-11-20 06:20:32,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:20:32,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:20:32,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i [2024-11-20 06:20:32,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cbc9c0d/d881e12838c348e0a2934890660bf518/FLAGeb25b1930 [2024-11-20 06:20:32,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cbc9c0d/d881e12838c348e0a2934890660bf518 [2024-11-20 06:20:32,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:20:32,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:20:32,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:32,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:20:32,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:20:32,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785d1f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32, skipping insertion in model container [2024-11-20 06:20:32,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:20:32,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i[916,929] [2024-11-20 06:20:32,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:32,726 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:20:32,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i[916,929] [2024-11-20 06:20:32,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:32,782 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:20:32,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32 WrapperNode [2024-11-20 06:20:32,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:32,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:32,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:20:32,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:20:32,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,831 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-11-20 06:20:32,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:32,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:20:32,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:20:32,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:20:32,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,864 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:20:32,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:20:32,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:20:32,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:20:32,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:20:32,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (1/1) ... [2024-11-20 06:20:32,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:32,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:32,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:20:32,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:20:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:20:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:20:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:20:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:20:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:20:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:20:33,040 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:20:33,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:20:33,384 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-20 06:20:33,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:20:33,401 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:20:33,402 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:20:33,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:20:33 BoogieIcfgContainer [2024-11-20 06:20:33,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:20:33,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:20:33,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:20:33,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:20:33,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:20:32" (1/3) ... [2024-11-20 06:20:33,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457809ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:20:33, skipping insertion in model container [2024-11-20 06:20:33,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:32" (2/3) ... [2024-11-20 06:20:33,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457809ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:20:33, skipping insertion in model container [2024-11-20 06:20:33,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:20:33" (3/3) ... [2024-11-20 06:20:33,410 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-13.i [2024-11-20 06:20:33,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:20:33,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:20:33,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:20:33,478 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;@2c37eee9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:20:33,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:20:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 06:20:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 06:20:33,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:33,496 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:33,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:33,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2122545668, now seen corresponding path program 1 times [2024-11-20 06:20:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118299644] [2024-11-20 06:20:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:20:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:20:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 06:20:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 06:20:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 06:20:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 06:20:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 06:20:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 06:20:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:20:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:20:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:20:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:20:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:20:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 06:20:33,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118299644] [2024-11-20 06:20:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118299644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:33,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:33,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:20:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580898002] [2024-11-20 06:20:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:33,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:20:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:33,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:20:33,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:20:33,966 INFO L87 Difference]: Start difference. First operand has 105 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 06:20:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:33,992 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2024-11-20 06:20:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:20:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-20 06:20:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:34,003 INFO L225 Difference]: With dead ends: 201 [2024-11-20 06:20:34,004 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 06:20:34,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:20:34,011 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:34,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:20:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 06:20:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-20 06:20:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 06:20:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-11-20 06:20:34,050 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 192 [2024-11-20 06:20:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:34,051 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-11-20 06:20:34,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 06:20:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-11-20 06:20:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 06:20:34,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:34,054 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:34,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:20:34,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -419223502, now seen corresponding path program 1 times [2024-11-20 06:20:34,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:34,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185874075] [2024-11-20 06:20:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:20:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:20:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 06:20:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 06:20:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 06:20:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 06:20:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 06:20:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 06:20:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:20:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:20:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:20:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:20:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:20:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 06:20:34,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185874075] [2024-11-20 06:20:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185874075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:34,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:34,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:20:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304517580] [2024-11-20 06:20:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:34,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:20:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:20:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:20:34,436 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:34,648 INFO L93 Difference]: Finished difference Result 316 states and 492 transitions. [2024-11-20 06:20:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:20:34,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-20 06:20:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:34,652 INFO L225 Difference]: With dead ends: 316 [2024-11-20 06:20:34,652 INFO L226 Difference]: Without dead ends: 220 [2024-11-20 06:20:34,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:20:34,655 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 195 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:34,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 413 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:20:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-20 06:20:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 209. [2024-11-20 06:20:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.4391891891891893) internal successors, (213), 148 states have internal predecessors, (213), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 06:20:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 329 transitions. [2024-11-20 06:20:34,688 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 329 transitions. Word has length 192 [2024-11-20 06:20:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:34,688 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 329 transitions. [2024-11-20 06:20:34,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 329 transitions. [2024-11-20 06:20:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 06:20:34,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:34,693 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:34,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:20:34,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:34,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash 407504662, now seen corresponding path program 1 times [2024-11-20 06:20:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459278728] [2024-11-20 06:20:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:20:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:20:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 06:20:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 06:20:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 06:20:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 06:20:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 06:20:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 06:20:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:20:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:20:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:20:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:20:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:20:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 06:20:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459278728] [2024-11-20 06:20:34,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459278728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:34,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:34,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:20:34,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018676798] [2024-11-20 06:20:34,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:34,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:20:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:20:34,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:20:34,950 INFO L87 Difference]: Start difference. First operand 209 states and 329 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:35,000 INFO L93 Difference]: Finished difference Result 618 states and 975 transitions. [2024-11-20 06:20:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:20:35,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-20 06:20:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:35,007 INFO L225 Difference]: With dead ends: 618 [2024-11-20 06:20:35,007 INFO L226 Difference]: Without dead ends: 412 [2024-11-20 06:20:35,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:20:35,009 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 144 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:35,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:20:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-20 06:20:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-11-20 06:20:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 289 states have (on average 1.4186851211072664) internal successors, (410), 289 states have internal predecessors, (410), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-20 06:20:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 642 transitions. [2024-11-20 06:20:35,056 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 642 transitions. Word has length 193 [2024-11-20 06:20:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:35,056 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 642 transitions. [2024-11-20 06:20:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 642 transitions. [2024-11-20 06:20:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 06:20:35,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:35,058 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:35,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:20:35,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:35,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:35,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1009162728, now seen corresponding path program 1 times [2024-11-20 06:20:35,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:35,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130788409] [2024-11-20 06:20:35,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:35,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:20:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:20:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 06:20:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 06:20:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 06:20:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 06:20:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 06:20:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 06:20:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:20:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:20:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:20:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:20:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:20:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 06:20:35,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130788409] [2024-11-20 06:20:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130788409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:35,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:20:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039749251] [2024-11-20 06:20:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:35,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:20:35,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:35,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:20:35,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:20:35,481 INFO L87 Difference]: Start difference. First operand 410 states and 642 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:35,694 INFO L93 Difference]: Finished difference Result 1421 states and 2228 transitions. [2024-11-20 06:20:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:20:35,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-20 06:20:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:35,700 INFO L225 Difference]: With dead ends: 1421 [2024-11-20 06:20:35,700 INFO L226 Difference]: Without dead ends: 1014 [2024-11-20 06:20:35,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:20:35,702 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 225 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:35,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 490 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:20:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-20 06:20:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1010. [2024-11-20 06:20:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 709 states have (on average 1.382228490832158) internal successors, (980), 709 states have internal predecessors, (980), 290 states have call successors, (290), 10 states have call predecessors, (290), 10 states have return successors, (290), 290 states have call predecessors, (290), 290 states have call successors, (290) [2024-11-20 06:20:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1560 transitions. [2024-11-20 06:20:35,788 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1560 transitions. Word has length 193 [2024-11-20 06:20:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:35,790 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1560 transitions. [2024-11-20 06:20:35,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1560 transitions. [2024-11-20 06:20:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 06:20:35,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:35,792 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:35,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:20:35,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash -613563692, now seen corresponding path program 1 times [2024-11-20 06:20:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734594707] [2024-11-20 06:20:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:20:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:20:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 06:20:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 06:20:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 06:20:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 06:20:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 06:20:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 06:20:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:20:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:20:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:20:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:20:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:20:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 06:20:36,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734594707] [2024-11-20 06:20:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734594707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:36,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:36,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:20:36,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564135267] [2024-11-20 06:20:36,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:20:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:36,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:20:36,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:20:36,047 INFO L87 Difference]: Start difference. First operand 1010 states and 1560 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:36,499 INFO L93 Difference]: Finished difference Result 2805 states and 4311 transitions. [2024-11-20 06:20:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 06:20:36,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-20 06:20:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:36,509 INFO L225 Difference]: With dead ends: 2805 [2024-11-20 06:20:36,509 INFO L226 Difference]: Without dead ends: 1798 [2024-11-20 06:20:36,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:20:36,513 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 388 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:36,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 920 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:20:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-11-20 06:20:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1722. [2024-11-20 06:20:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1181 states have (on average 1.36155800169348) internal successors, (1608), 1181 states have internal predecessors, (1608), 522 states have call successors, (522), 18 states have call predecessors, (522), 18 states have return successors, (522), 522 states have call predecessors, (522), 522 states have call successors, (522) [2024-11-20 06:20:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2652 transitions. [2024-11-20 06:20:36,673 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2652 transitions. Word has length 193 [2024-11-20 06:20:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:36,674 INFO L471 AbstractCegarLoop]: Abstraction has 1722 states and 2652 transitions. [2024-11-20 06:20:36,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:20:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2652 transitions. [2024-11-20 06:20:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 06:20:36,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:36,676 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:36,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:20:36,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:36,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1380581014, now seen corresponding path program 1 times [2024-11-20 06:20:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:36,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734282076] [2024-11-20 06:20:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:20:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:20:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 06:20:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 06:20:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 06:20:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 06:20:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 06:20:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 06:20:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:20:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:20:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:20:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:20:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:20:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 06:20:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734282076] [2024-11-20 06:20:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734282076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:20:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556581749] [2024-11-20 06:20:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:37,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:37,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:37,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:20:37,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 06:20:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:37,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 06:20:37,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:20:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 541 proven. 24 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 06:20:38,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:20:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556581749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:20:39,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:20:39,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-11-20 06:20:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593689151] [2024-11-20 06:20:39,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:20:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 06:20:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:39,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 06:20:39,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2024-11-20 06:20:39,993 INFO L87 Difference]: Start difference. First operand 1722 states and 2652 transitions. Second operand has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-11-20 06:20:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:50,610 INFO L93 Difference]: Finished difference Result 8959 states and 13185 transitions. [2024-11-20 06:20:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2024-11-20 06:20:50,611 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) Word has length 193 [2024-11-20 06:20:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:50,645 INFO L225 Difference]: With dead ends: 8959 [2024-11-20 06:20:50,646 INFO L226 Difference]: Without dead ends: 8464 [2024-11-20 06:20:50,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20148 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6556, Invalid=44746, Unknown=0, NotChecked=0, Total=51302 [2024-11-20 06:20:50,659 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 3599 mSDsluCounter, 5694 mSDsCounter, 0 mSdLazyCounter, 6121 mSolverCounterSat, 1871 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3716 SdHoareTripleChecker+Valid, 6241 SdHoareTripleChecker+Invalid, 7992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1871 IncrementalHoareTripleChecker+Valid, 6121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:50,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3716 Valid, 6241 Invalid, 7992 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1871 Valid, 6121 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-20 06:20:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states. [2024-11-20 06:20:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 5633. [2024-11-20 06:20:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5633 states, 3957 states have (on average 1.3459691685620419) internal successors, (5326), 3994 states have internal predecessors, (5326), 1561 states have call successors, (1561), 114 states have call predecessors, (1561), 114 states have return successors, (1561), 1524 states have call predecessors, (1561), 1561 states have call successors, (1561) [2024-11-20 06:20:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5633 states to 5633 states and 8448 transitions. [2024-11-20 06:20:51,121 INFO L78 Accepts]: Start accepts. Automaton has 5633 states and 8448 transitions. Word has length 193 [2024-11-20 06:20:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:51,121 INFO L471 AbstractCegarLoop]: Abstraction has 5633 states and 8448 transitions. [2024-11-20 06:20:51,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-11-20 06:20:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5633 states and 8448 transitions. [2024-11-20 06:20:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 06:20:51,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:51,124 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:51,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:20:51,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 06:20:51,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash 793775000, now seen corresponding path program 1 times [2024-11-20 06:20:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893217102] [2024-11-20 06:20:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:20:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203540135] [2024-11-20 06:20:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:51,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:51,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:51,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:20:51,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 06:20:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:20:51,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:20:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:20:51,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:20:51,782 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:20:51,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:20:51,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 06:20:51,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 06:20:51,988 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:52,099 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:20:52,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:20:52 BoogieIcfgContainer [2024-11-20 06:20:52,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:20:52,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:20:52,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:20:52,105 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:20:52,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:20:33" (3/4) ... [2024-11-20 06:20:52,107 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:20:52,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:20:52,109 INFO L158 Benchmark]: Toolchain (without parser) took 19682.55ms. Allocated memory was 192.9MB in the beginning and 536.9MB in the end (delta: 343.9MB). Free memory was 130.1MB in the beginning and 347.0MB in the end (delta: -216.9MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2024-11-20 06:20:52,109 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 96.5MB. Free memory is still 46.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:20:52,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.56ms. Allocated memory is still 192.9MB. Free memory was 129.6MB in the beginning and 157.5MB in the end (delta: -27.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 06:20:52,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.69ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 154.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:20:52,109 INFO L158 Benchmark]: Boogie Preprocessor took 47.98ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 150.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:20:52,109 INFO L158 Benchmark]: RCFGBuilder took 519.73ms. Allocated memory is still 192.9MB. Free memory was 150.2MB in the beginning and 120.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-20 06:20:52,110 INFO L158 Benchmark]: TraceAbstraction took 18700.15ms. Allocated memory was 192.9MB in the beginning and 536.9MB in the end (delta: 343.9MB). Free memory was 119.8MB in the beginning and 347.0MB in the end (delta: -227.2MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. [2024-11-20 06:20:52,110 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 536.9MB. Free memory is still 347.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:20:52,111 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.08ms. Allocated memory is still 96.5MB. Free memory is still 46.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.56ms. Allocated memory is still 192.9MB. Free memory was 129.6MB in the beginning and 157.5MB in the end (delta: -27.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.69ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 154.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.98ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 150.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 519.73ms. Allocated memory is still 192.9MB. Free memory was 150.2MB in the beginning and 120.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18700.15ms. Allocated memory was 192.9MB in the beginning and 536.9MB in the end (delta: 343.9MB). Free memory was 119.8MB in the beginning and 347.0MB in the end (delta: -227.2MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 536.9MB. Free memory is still 347.0MB. 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 208, overapproximation of someBinaryFLOATComparisonOperation at line 208, overapproximation of someBinaryArithmeticDOUBLEoperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_5 = 25; [L24] signed short int var_1_7 = 128; [L25] signed short int var_1_8 = 256; [L26] signed char var_1_9 = -10; [L27] signed char var_1_10 = -16; [L28] signed char var_1_11 = -10; [L29] signed char var_1_12 = -25; [L30] double var_1_13 = 64.875; [L31] double var_1_15 = 1.625; [L32] double var_1_16 = 32.2; [L33] double var_1_17 = 8.6; [L34] double var_1_18 = 10.5; [L35] double var_1_19 = 4.25; [L36] float var_1_20 = 64.5; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] signed long int var_1_25 = -5; [L41] unsigned char var_1_26 = 1; [L42] unsigned char var_1_28 = 0; [L43] signed long int var_1_29 = -10; [L44] float var_1_30 = 10.4; [L45] unsigned long int var_1_31 = 8; [L46] unsigned short int var_1_32 = 47145; [L47] unsigned short int var_1_33 = 17741; [L48] unsigned short int var_1_34 = 2; [L49] unsigned long int var_1_35 = 3282184810; [L50] signed short int last_1_var_1_5 = 25; [L51] signed char last_1_var_1_9 = -10; [L52] double last_1_var_1_13 = 64.875; [L53] signed long int last_1_var_1_25 = -5; [L54] unsigned char last_1_var_1_26 = 1; [L55] signed long int last_1_var_1_29 = -10; [L56] unsigned long int last_1_var_1_31 = 8; VAL [isInitial=0, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=128, var_1_8=256, var_1_9=-10] [L212] isInitial = 1 [L213] FCALL initially() [L214] COND TRUE 1 [L215] CALL updateLastVariables() [L199] last_1_var_1_5 = var_1_5 [L200] last_1_var_1_9 = var_1_9 [L201] last_1_var_1_13 = var_1_13 [L202] last_1_var_1_25 = var_1_25 [L203] last_1_var_1_26 = var_1_26 [L204] last_1_var_1_29 = var_1_29 [L205] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=128, var_1_8=256, var_1_9=-10] [L215] RET updateLastVariables() [L216] CALL updateVariables() [L151] var_1_7 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L152] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L153] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L154] var_1_8 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L155] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L156] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L157] var_1_10 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_10 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L158] RET assume_abort_if_not(var_1_10 >= -31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L159] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L160] var_1_11 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L161] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L162] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L163] var_1_12 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L164] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L165] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L166] var_1_15 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L167] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L168] var_1_16 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L169] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L170] var_1_17 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L171] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L172] var_1_18 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L173] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L174] var_1_19 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L175] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L176] var_1_23 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L178] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L178] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L179] var_1_24 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L181] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L181] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L184] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L184] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L185] var_1_32 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_32 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L186] RET assume_abort_if_not(var_1_32 >= 32767) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L187] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L187] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L188] var_1_33 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_33 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L189] RET assume_abort_if_not(var_1_33 >= 16383) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L190] CALL assume_abort_if_not(var_1_33 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L190] RET assume_abort_if_not(var_1_33 <= 32767) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L191] var_1_34 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L192] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L193] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L193] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L194] var_1_35 = __VERIFIER_nondet_ulong() [L195] CALL assume_abort_if_not(var_1_35 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L195] RET assume_abort_if_not(var_1_35 >= 3221225471) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L196] CALL assume_abort_if_not(var_1_35 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L196] RET assume_abort_if_not(var_1_35 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L216] RET updateVariables() [L217] CALL step() [L60] unsigned char stepLocal_4 = last_1_var_1_9 >= 4; [L61] signed long int stepLocal_3 = last_1_var_1_9 % 50; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_3=-10, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L62] EXPR last_1_var_1_9 & last_1_var_1_9 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_3=-10, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L62] unsigned char stepLocal_2 = (- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9); [L63] COND FALSE !(last_1_var_1_25 < stepLocal_3) [L78] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L80] COND FALSE !(9.6 <= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L85] unsigned char stepLocal_5 = var_1_24; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L86] COND FALSE !(stepLocal_5 && (var_1_17 != var_1_19)) [L91] var_1_29 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L93] unsigned long int stepLocal_0 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_0=8, stepLocal_2=1, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L94] COND TRUE stepLocal_0 > var_1_7 [L95] var_1_9 = ((var_1_10 + var_1_11) + var_1_12) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L97] COND TRUE (var_1_9 * (var_1_8 - 128)) < var_1_10 [L98] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L100] COND FALSE !((var_1_9 <= var_1_29) || var_1_22) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L103] unsigned long int stepLocal_9 = (var_1_35 - var_1_32) - ((((var_1_8) < (var_1_33)) ? (var_1_8) : (var_1_33))); [L104] signed long int stepLocal_8 = var_1_29; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_8=25, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L105] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_8=25, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L106] COND FALSE !((var_1_32 - (var_1_33 - var_1_34)) >= stepLocal_8) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L116] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_1=27, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L117] COND TRUE stepLocal_1 > var_1_31 [L118] var_1_13 = ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=27] [L126] COND TRUE var_1_1 || var_1_22 [L127] var_1_5 = ((((50) < (var_1_9)) ? (50) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=27, var_1_7=0, var_1_8=26, var_1_9=27] [L133] COND TRUE var_1_1 && ((var_1_8 >= var_1_29) || var_1_26) [L134] var_1_25 = ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=27, var_1_7=0, var_1_8=26, var_1_9=27] [L138] unsigned long int stepLocal_7 = var_1_31; [L139] signed short int stepLocal_6 = var_1_7; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_6=0, stepLocal_7=8, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=27, var_1_7=0, var_1_8=26, var_1_9=27] [L140] COND FALSE !(stepLocal_7 <= var_1_25) [L147] var_1_30 = var_1_16 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_6=0, stepLocal_9=-32796, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=27, var_1_7=0, var_1_8=26, var_1_9=27] [L217] RET step() [L218] CALL, EXPR property() [L208] EXPR (((((((((var_1_9 <= var_1_29) || var_1_22) ? (var_1_1 == ((unsigned char) 0)) : 1) && ((var_1_1 || var_1_22) ? (var_1_5 == ((signed short int) ((((50) < (var_1_9)) ? (50) : (var_1_9))))) : (var_1_22 ? (var_1_5 == ((signed short int) (var_1_7 - var_1_8))) : 1))) && ((last_1_var_1_31 > var_1_7) ? (var_1_9 == ((signed char) ((var_1_10 + var_1_11) + var_1_12))) : 1)) && ((var_1_9 > var_1_31) ? (var_1_13 == ((double) ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)))) : (var_1_22 ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_19))))) && (((var_1_9 * (var_1_8 - 128)) < var_1_10) ? (var_1_20 == ((float) var_1_15)) : 1)) && ((9.6 <= last_1_var_1_13) ? ((var_1_19 == 4.125) ? (var_1_22 == ((unsigned char) (var_1_23 || var_1_24))) : 1) : 1)) && ((var_1_1 && ((var_1_8 >= var_1_29) || var_1_26)) ? (var_1_25 == ((signed long int) ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))))) : (var_1_25 == ((signed long int) (var_1_5 + 16))))) && ((last_1_var_1_25 < (last_1_var_1_9 % 50)) ? (((128u <= last_1_var_1_29) && (last_1_var_1_9 >= 4)) ? ((((- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9)) && last_1_var_1_26) ? (var_1_26 == ((unsigned char) var_1_23)) : ((((((var_1_19) < (1.6)) ? (var_1_19) : (1.6))) < (var_1_16 - var_1_15)) ? (var_1_26 == ((unsigned char) (! var_1_28))) : (var_1_26 == ((unsigned char) var_1_23)))) : (var_1_26 == ((unsigned char) var_1_28))) : (var_1_26 == ((unsigned char) var_1_24))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=27, var_1_7=0, var_1_8=26, var_1_9=27] [L208-L209] return ((((((((((((var_1_9 <= var_1_29) || var_1_22) ? (var_1_1 == ((unsigned char) 0)) : 1) && ((var_1_1 || var_1_22) ? (var_1_5 == ((signed short int) ((((50) < (var_1_9)) ? (50) : (var_1_9))))) : (var_1_22 ? (var_1_5 == ((signed short int) (var_1_7 - var_1_8))) : 1))) && ((last_1_var_1_31 > var_1_7) ? (var_1_9 == ((signed char) ((var_1_10 + var_1_11) + var_1_12))) : 1)) && ((var_1_9 > var_1_31) ? (var_1_13 == ((double) ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)))) : (var_1_22 ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_19))))) && (((var_1_9 * (var_1_8 - 128)) < var_1_10) ? (var_1_20 == ((float) var_1_15)) : 1)) && ((9.6 <= last_1_var_1_13) ? ((var_1_19 == 4.125) ? (var_1_22 == ((unsigned char) (var_1_23 || var_1_24))) : 1) : 1)) && ((var_1_1 && ((var_1_8 >= var_1_29) || var_1_26)) ? (var_1_25 == ((signed long int) ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))))) : (var_1_25 == ((signed long int) (var_1_5 + 16))))) && ((last_1_var_1_25 < (last_1_var_1_9 % 50)) ? (((128u <= last_1_var_1_29) && (last_1_var_1_9 >= 4)) ? ((((- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9)) && last_1_var_1_26) ? (var_1_26 == ((unsigned char) var_1_23)) : ((((((var_1_19) < (1.6)) ? (var_1_19) : (1.6))) < (var_1_16 - var_1_15)) ? (var_1_26 == ((unsigned char) (! var_1_28))) : (var_1_26 == ((unsigned char) var_1_23)))) : (var_1_26 == ((unsigned char) var_1_28))) : (var_1_26 == ((unsigned char) var_1_24)))) && ((var_1_24 && (var_1_17 != var_1_19)) ? ((! last_1_var_1_26) ? (var_1_29 == ((signed long int) -256)) : 1) : (var_1_29 == ((signed long int) last_1_var_1_5)))) && ((var_1_31 <= var_1_25) ? ((var_1_7 > (var_1_12 + var_1_25)) ? (var_1_30 == ((float) (var_1_15 - ((((var_1_16) < (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))) ? (var_1_16) : (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))))) : (var_1_30 == ((float) var_1_18))) : (var_1_30 == ((float) var_1_16)))) && (var_1_1 ? (((var_1_32 - (var_1_33 - var_1_34)) >= var_1_29) ? (var_1_31 == ((unsigned long int) (32u + var_1_33))) : 1) : ((last_1_var_1_31 <= ((var_1_35 - var_1_32) - ((((var_1_8) < (var_1_33)) ? (var_1_8) : (var_1_33))))) ? (var_1_31 == ((unsigned long int) var_1_33)) : (var_1_31 == ((unsigned long int) var_1_8)))) ; [L218] RET, EXPR property() [L218] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=27, var_1_7=0, var_1_8=26, var_1_9=27] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=0, var_1_11=27, var_1_12=0, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=32768, var_1_33=32745, var_1_34=0, var_1_35=-2, var_1_5=27, var_1_7=0, var_1_8=26, var_1_9=27] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4668 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4551 mSDsluCounter, 8614 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6869 mSDsCounter, 2057 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6541 IncrementalHoareTripleChecker+Invalid, 8598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2057 mSolverCounterUnsat, 1745 mSDtfsCounter, 6541 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 891 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20150 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5633occurred in iteration=6, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 6 MinimizatonAttempts, 2924 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1735 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1342 ConstructedInterpolants, 0 QuantifiedInterpolants, 3881 SizeOfPredicates, 8 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 11329/11368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:20:52,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0119f4ac8e4474ee05349e3ca0ec6dedfa1ab2168a7e9ac9d3b19942a2e0f51d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:20:54,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:20:54,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:20:54,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:20:54,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:20:54,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:20:54,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:20:54,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:20:54,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:20:54,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:20:54,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:20:54,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:20:54,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:20:54,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:20:54,165 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:20:54,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:20:54,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:20:54,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:20:54,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:20:54,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:20:54,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:20:54,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:20:54,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:20:54,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:20:54,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:20:54,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:20:54,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:20:54,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:20:54,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:20:54,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:20:54,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:20:54,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:20:54,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:20:54,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:20:54,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:54,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:20:54,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:20:54,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:20:54,172 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:20:54,172 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:20:54,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:20:54,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:20:54,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:20:54,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:20:54,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0119f4ac8e4474ee05349e3ca0ec6dedfa1ab2168a7e9ac9d3b19942a2e0f51d [2024-11-20 06:20:54,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:20:54,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:20:54,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:20:54,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:20:54,438 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:20:54,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i [2024-11-20 06:20:55,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:20:55,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:20:55,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i [2024-11-20 06:20:55,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/623bf51e1/ea4b5126d7404ee79accc6d4bdf4a671/FLAGc3002a893 [2024-11-20 06:20:56,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/623bf51e1/ea4b5126d7404ee79accc6d4bdf4a671 [2024-11-20 06:20:56,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:20:56,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:20:56,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:56,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:20:56,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:20:56,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4777bdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56, skipping insertion in model container [2024-11-20 06:20:56,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:20:56,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i[916,929] [2024-11-20 06:20:56,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:56,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:20:56,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-13.i[916,929] [2024-11-20 06:20:56,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:56,583 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:20:56,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56 WrapperNode [2024-11-20 06:20:56,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:56,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:56,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:20:56,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:20:56,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,642 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-20 06:20:56,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:56,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:20:56,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:20:56,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:20:56,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,675 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:20:56,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:20:56,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:20:56,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:20:56,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:20:56,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (1/1) ... [2024-11-20 06:20:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:56,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:20:56,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:20:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:20:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:20:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:20:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:20:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:20:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:20:56,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:20:56,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:21:03,355 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-20 06:21:03,355 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:21:03,364 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:21:03,365 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:21:03,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:21:03 BoogieIcfgContainer [2024-11-20 06:21:03,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:21:03,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:21:03,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:21:03,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:21:03,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:20:56" (1/3) ... [2024-11-20 06:21:03,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4466874e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:21:03, skipping insertion in model container [2024-11-20 06:21:03,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:56" (2/3) ... [2024-11-20 06:21:03,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4466874e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:21:03, skipping insertion in model container [2024-11-20 06:21:03,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:21:03" (3/3) ... [2024-11-20 06:21:03,371 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-13.i [2024-11-20 06:21:03,381 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:21:03,381 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:21:03,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:21:03,440 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;@683b056f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:21:03,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:21:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 06:21:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 06:21:03,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:21:03,456 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:21:03,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:21:03,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:21:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash 858180452, now seen corresponding path program 1 times [2024-11-20 06:21:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:21:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898880413] [2024-11-20 06:21:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:03,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:21:03,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:21:03,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:21:03,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:21:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:04,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:21:04,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-20 06:21:04,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:21:04,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:21:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898880413] [2024-11-20 06:21:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898880413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:21:04,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:21:04,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:21:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120027596] [2024-11-20 06:21:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:21:04,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:21:04,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:21:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:21:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:21:04,091 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 06:21:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:21:04,114 INFO L93 Difference]: Finished difference Result 175 states and 309 transitions. [2024-11-20 06:21:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:21:04,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-11-20 06:21:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:21:04,122 INFO L225 Difference]: With dead ends: 175 [2024-11-20 06:21:04,122 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 06:21:04,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:21:04,129 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:21:04,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:21:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 06:21:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 06:21:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 06:21:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-11-20 06:21:04,169 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 188 [2024-11-20 06:21:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:21:04,169 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-11-20 06:21:04,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 06:21:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-11-20 06:21:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 06:21:04,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:21:04,172 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:21:04,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 06:21:04,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:21:04,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:21:04,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:21:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash 831715482, now seen corresponding path program 1 times [2024-11-20 06:21:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:21:04,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743122095] [2024-11-20 06:21:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:04,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:21:04,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:21:04,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:21:04,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:21:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:04,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 06:21:04,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 06:21:08,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:21:08,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:21:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743122095] [2024-11-20 06:21:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743122095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:21:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:21:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:21:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987929597] [2024-11-20 06:21:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:21:08,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:21:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:21:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:21:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:21:08,950 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:21:11,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:21:16,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:21:20,726 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-11-20 06:21:23,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:21:28,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:21:32,817 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-11-20 06:21:32,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:21:32,817 INFO L93 Difference]: Finished difference Result 256 states and 403 transitions. [2024-11-20 06:21:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:21:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-11-20 06:21:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:21:32,874 INFO L225 Difference]: With dead ends: 256 [2024-11-20 06:21:32,874 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 06:21:32,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:21:32,876 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 107 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 59 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:21:32,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 348 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 23.8s Time] [2024-11-20 06:21:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 06:21:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 144. [2024-11-20 06:21:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 06:21:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 225 transitions. [2024-11-20 06:21:32,904 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 225 transitions. Word has length 188 [2024-11-20 06:21:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:21:32,905 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 225 transitions. [2024-11-20 06:21:32,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 06:21:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 225 transitions. [2024-11-20 06:21:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 06:21:32,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:21:32,907 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:21:32,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 06:21:33,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:21:33,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:21:33,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:21:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1563025669, now seen corresponding path program 1 times [2024-11-20 06:21:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:21:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273270980] [2024-11-20 06:21:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:33,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:21:33,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:21:33,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:21:33,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 06:21:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:33,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 06:21:33,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 541 proven. 24 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 06:21:38,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:21:40,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:21:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273270980] [2024-11-20 06:21:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273270980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:21:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1370736534] [2024-11-20 06:21:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:21:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:21:40,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 06:21:40,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 06:21:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:42,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 06:21:42,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 541 proven. 24 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 06:21:45,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:21:46,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1370736534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:21:46,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:21:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-20 06:21:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125483361] [2024-11-20 06:21:46,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:21:46,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 06:21:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:21:46,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 06:21:46,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-20 06:21:46,233 INFO L87 Difference]: Start difference. First operand 144 states and 225 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-20 06:21:53,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 06:21:58,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []