./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.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 ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:23:38,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:23:38,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:23:38,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:23:38,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:23:38,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:23:38,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:23:38,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:23:38,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:23:38,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:23:38,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:23:38,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:23:38,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:23:38,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:23:38,695 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:23:38,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:23:38,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:23:38,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:23:38,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:23:38,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:23:38,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:23:38,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:23:38,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:23:38,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:23:38,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:23:38,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:23:38,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:23:38,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:23:38,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:23:38,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:23:38,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:23:38,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:23:38,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:23:38,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:23:38,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:23:38,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:23:38,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:23:38,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:23:38,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:23:38,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:23:38,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:23:38,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:23:38,704 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 -> ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 [2024-11-08 23:23:38,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:23:38,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:23:38,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:23:38,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:23:38,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:23:38,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-11-08 23:23:40,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:23:40,388 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:23:40,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-11-08 23:23:40,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a39b176/b421adada7124adfad0e719e99df006a/FLAGc171f5ca2 [2024-11-08 23:23:40,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a39b176/b421adada7124adfad0e719e99df006a [2024-11-08 23:23:40,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:23:40,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:23:40,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:23:40,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:23:40,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:23:40,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698036a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40, skipping insertion in model container [2024-11-08 23:23:40,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:23:40,573 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-1loop_file-72.i[916,929] [2024-11-08 23:23:40,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:23:40,658 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:23:40,674 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-1loop_file-72.i[916,929] [2024-11-08 23:23:40,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:23:40,740 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:23:40,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40 WrapperNode [2024-11-08 23:23:40,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:23:40,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:23:40,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:23:40,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:23:40,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,813 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 309 [2024-11-08 23:23:40,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:23:40,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:23:40,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:23:40,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:23:40,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,931 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-08 23:23:40,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:23:40,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:23:40,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:23:40,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:23:40,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (1/1) ... [2024-11-08 23:23:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:23:40,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:23:41,004 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-08 23:23:41,009 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-08 23:23:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:23:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:23:41,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:23:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:23:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:23:41,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:23:41,113 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:23:41,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:23:41,559 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-08 23:23:41,559 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:23:41,588 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:23:41,588 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:23:41,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:23:41 BoogieIcfgContainer [2024-11-08 23:23:41,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:23:41,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:23:41,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:23:41,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:23:41,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:23:40" (1/3) ... [2024-11-08 23:23:41,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4909dc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:23:41, skipping insertion in model container [2024-11-08 23:23:41,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:40" (2/3) ... [2024-11-08 23:23:41,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4909dc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:23:41, skipping insertion in model container [2024-11-08 23:23:41,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:23:41" (3/3) ... [2024-11-08 23:23:41,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-11-08 23:23:41,625 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:23:41,625 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:23:41,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:23:41,711 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;@2c6ffd08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:23:41,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:23:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 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-08 23:23:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 23:23:41,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:41,753 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, 1] [2024-11-08 23:23:41,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1794378133, now seen corresponding path program 1 times [2024-11-08 23:23:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985442209] [2024-11-08 23:23:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:23:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:23:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:23:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:23:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:23:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:23:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:23:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:23:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:23:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:23:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:23:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:23:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:23:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:23:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:23:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:23:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:23:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:23:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:23:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:23:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:23:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:23:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:23:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:23:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:23:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:23:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:23:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:23:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:23:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:42,150 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-08 23:23:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985442209] [2024-11-08 23:23:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985442209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:23:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:23:42,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:23:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835162821] [2024-11-08 23:23:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:23:42,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:23:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:42,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:23:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:23:42,179 INFO L87 Difference]: Start difference. First operand has 126 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-08 23:23:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:42,213 INFO L93 Difference]: Finished difference Result 245 states and 412 transitions. [2024-11-08 23:23:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:23:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 194 [2024-11-08 23:23:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:42,237 INFO L225 Difference]: With dead ends: 245 [2024-11-08 23:23:42,241 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 23:23:42,247 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-08 23:23:42,250 INFO L432 NwaCegarLoop]: 185 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, 185 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-08 23:23:42,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:23:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 23:23:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 23:23:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 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-08 23:23:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 181 transitions. [2024-11-08 23:23:42,353 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 181 transitions. Word has length 194 [2024-11-08 23:23:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:42,357 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 181 transitions. [2024-11-08 23:23:42,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-08 23:23:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 181 transitions. [2024-11-08 23:23:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 23:23:42,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:42,364 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, 1] [2024-11-08 23:23:42,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:23:42,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:42,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1253053335, now seen corresponding path program 1 times [2024-11-08 23:23:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:42,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763373380] [2024-11-08 23:23:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:23:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:23:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:23:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:23:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:23:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:23:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:23:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:23:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:23:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:23:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:23:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:23:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:23:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:23:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:23:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:23:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:23:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:23:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:23:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:23:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:23:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:23:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:23:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:23:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:23:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:23:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:23:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:23:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:23:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:43,215 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-08 23:23:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763373380] [2024-11-08 23:23:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763373380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:23:43,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:23:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:23:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827322688] [2024-11-08 23:23:43,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:23:43,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:23:43,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:43,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:23:43,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:23:43,220 INFO L87 Difference]: Start difference. First operand 118 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 23:23:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:43,580 INFO L93 Difference]: Finished difference Result 424 states and 645 transitions. [2024-11-08 23:23:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:23:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 194 [2024-11-08 23:23:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:43,588 INFO L225 Difference]: With dead ends: 424 [2024-11-08 23:23:43,589 INFO L226 Difference]: Without dead ends: 309 [2024-11-08 23:23:43,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:23:43,594 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 312 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:23:43,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 838 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:23:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-08 23:23:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 290. [2024-11-08 23:23:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 221 states have (on average 1.3936651583710407) internal successors, (308), 222 states have internal predecessors, (308), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:23:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 436 transitions. [2024-11-08 23:23:43,642 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 436 transitions. Word has length 194 [2024-11-08 23:23:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:43,643 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 436 transitions. [2024-11-08 23:23:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 23:23:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2024-11-08 23:23:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 23:23:43,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:43,666 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, 1] [2024-11-08 23:23:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:23:43,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1511218773, now seen corresponding path program 1 times [2024-11-08 23:23:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232419990] [2024-11-08 23:23:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:23:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:23:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:23:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:23:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:23:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:23:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:23:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:23:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:23:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:23:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:23:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:23:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:23:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:23:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:23:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:23:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:23:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:23:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:23:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:23:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:23:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:23:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:23:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:23:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:23:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:23:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:23:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:23:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:23:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,786 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-08 23:23:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232419990] [2024-11-08 23:23:44,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232419990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:23:44,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:23:44,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:23:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748806800] [2024-11-08 23:23:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:23:44,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:23:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:44,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:23:44,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:23:44,790 INFO L87 Difference]: Start difference. First operand 290 states and 436 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-08 23:23:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:45,038 INFO L93 Difference]: Finished difference Result 849 states and 1254 transitions. [2024-11-08 23:23:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:23:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 194 [2024-11-08 23:23:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:45,044 INFO L225 Difference]: With dead ends: 849 [2024-11-08 23:23:45,044 INFO L226 Difference]: Without dead ends: 562 [2024-11-08 23:23:45,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:23:45,046 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 300 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:23:45,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 637 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:23:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-08 23:23:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 482. [2024-11-08 23:23:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 404 states have (on average 1.4207920792079207) internal successors, (574), 408 states have internal predecessors, (574), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:23:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 714 transitions. [2024-11-08 23:23:45,068 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 714 transitions. Word has length 194 [2024-11-08 23:23:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:45,069 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 714 transitions. [2024-11-08 23:23:45,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-08 23:23:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 714 transitions. [2024-11-08 23:23:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 23:23:45,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:45,071 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, 1] [2024-11-08 23:23:45,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:23:45,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:45,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1573258387, now seen corresponding path program 1 times [2024-11-08 23:23:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:45,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974347466] [2024-11-08 23:23:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:23:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:23:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:23:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:23:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:23:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:23:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:23:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:23:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:23:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:23:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:23:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:23:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:23:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:23:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:23:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:23:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:23:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:23:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:23:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:23:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:23:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:23:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:23:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:23:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:23:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:23:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:23:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:23:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:23:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,163 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-08 23:23:46,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:46,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974347466] [2024-11-08 23:23:46,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974347466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:23:46,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:23:46,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:23:46,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365293012] [2024-11-08 23:23:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:23:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:23:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:46,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:23:46,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:23:46,165 INFO L87 Difference]: Start difference. First operand 482 states and 714 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-08 23:23:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:46,484 INFO L93 Difference]: Finished difference Result 1021 states and 1489 transitions. [2024-11-08 23:23:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:23:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 194 [2024-11-08 23:23:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:46,489 INFO L225 Difference]: With dead ends: 1021 [2024-11-08 23:23:46,490 INFO L226 Difference]: Without dead ends: 542 [2024-11-08 23:23:46,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:23:46,493 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 232 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:23:46,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 829 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:23:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-08 23:23:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 418. [2024-11-08 23:23:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 334 states have (on average 1.3892215568862276) internal successors, (464), 338 states have internal predecessors, (464), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 23:23:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 612 transitions. [2024-11-08 23:23:46,524 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 612 transitions. Word has length 194 [2024-11-08 23:23:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 612 transitions. [2024-11-08 23:23:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-08 23:23:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 612 transitions. [2024-11-08 23:23:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:23:46,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:46,528 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, 1, 1, 1] [2024-11-08 23:23:46,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:23:46,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:46,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1680444415, now seen corresponding path program 1 times [2024-11-08 23:23:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531700616] [2024-11-08 23:23:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:23:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:23:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:23:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:23:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:23:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:23:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:23:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:23:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:23:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:23:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:23:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:23:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:23:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:23:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:23:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:23:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:23:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:23:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:23:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:23:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:23:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:23:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:23:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:23:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:23:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:23:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:23:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:23:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:23:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,252 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-08 23:23:47,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531700616] [2024-11-08 23:23:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531700616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:23:47,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:23:47,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:23:47,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845774383] [2024-11-08 23:23:47,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:23:47,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:23:47,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:47,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:23:47,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:23:47,254 INFO L87 Difference]: Start difference. First operand 418 states and 612 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-08 23:23:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:47,579 INFO L93 Difference]: Finished difference Result 1107 states and 1614 transitions. [2024-11-08 23:23:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:23:47,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 196 [2024-11-08 23:23:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:47,585 INFO L225 Difference]: With dead ends: 1107 [2024-11-08 23:23:47,586 INFO L226 Difference]: Without dead ends: 692 [2024-11-08 23:23:47,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:23:47,588 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 111 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:23:47,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 672 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:23:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-08 23:23:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 688. [2024-11-08 23:23:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 561 states have (on average 1.3814616755793225) internal successors, (775), 570 states have internal predecessors, (775), 110 states have call successors, (110), 16 states have call predecessors, (110), 16 states have return successors, (110), 101 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 23:23:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 995 transitions. [2024-11-08 23:23:47,646 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 995 transitions. Word has length 196 [2024-11-08 23:23:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:47,648 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 995 transitions. [2024-11-08 23:23:47,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-08 23:23:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 995 transitions. [2024-11-08 23:23:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:23:47,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:47,652 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, 1, 1, 1] [2024-11-08 23:23:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:23:47,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -123264112, now seen corresponding path program 1 times [2024-11-08 23:23:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203208924] [2024-11-08 23:23:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:23:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:23:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:23:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:23:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:23:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:23:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:23:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:23:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:23:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:23:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:23:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:23:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:23:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:23:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:23:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:23:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:23:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:23:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:23:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:23:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:23:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:23:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:23:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:23:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:23:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:23:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:23:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:23:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:23:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 23:23:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203208924] [2024-11-08 23:23:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203208924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:23:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415149385] [2024-11-08 23:23:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:47,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:23:47,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:23:47,965 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-08 23:23:47,966 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-08 23:23:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:48,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:23:48,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:23:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2024-11-08 23:23:48,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:23:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 23:23:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415149385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:23:48,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:23:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:23:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414262336] [2024-11-08 23:23:48,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:23:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:23:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:23:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:23:48,650 INFO L87 Difference]: Start difference. First operand 688 states and 995 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-08 23:23:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:48,826 INFO L93 Difference]: Finished difference Result 1255 states and 1778 transitions. [2024-11-08 23:23:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:23:48,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 196 [2024-11-08 23:23:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:48,830 INFO L225 Difference]: With dead ends: 1255 [2024-11-08 23:23:48,830 INFO L226 Difference]: Without dead ends: 570 [2024-11-08 23:23:48,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:23:48,832 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 205 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:23:48,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 371 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:23:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-08 23:23:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 530. [2024-11-08 23:23:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 405 states have (on average 1.3135802469135802) internal successors, (532), 411 states have internal predecessors, (532), 104 states have call successors, (104), 20 states have call predecessors, (104), 20 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-08 23:23:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 740 transitions. [2024-11-08 23:23:48,868 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 740 transitions. Word has length 196 [2024-11-08 23:23:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:48,869 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 740 transitions. [2024-11-08 23:23:48,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-08 23:23:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 740 transitions. [2024-11-08 23:23:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:23:48,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:48,871 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, 1, 1, 1] [2024-11-08 23:23:48,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:23:49,072 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-08 23:23:49,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:49,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash -632737202, now seen corresponding path program 1 times [2024-11-08 23:23:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:49,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872356799] [2024-11-08 23:23:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:49,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:23:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631826764] [2024-11-08 23:23:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:49,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:23:49,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:23:49,146 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-08 23:23:49,147 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-08 23:23:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:49,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 23:23:49,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:23:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 852 proven. 216 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-08 23:23:50,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:23:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 156 proven. 162 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-08 23:23:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:50,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872356799] [2024-11-08 23:23:50,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:23:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631826764] [2024-11-08 23:23:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631826764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:23:50,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:23:50,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2024-11-08 23:23:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118364823] [2024-11-08 23:23:50,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:23:50,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 23:23:50,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:50,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 23:23:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2024-11-08 23:23:50,727 INFO L87 Difference]: Start difference. First operand 530 states and 740 transitions. Second operand has 30 states, 28 states have (on average 3.642857142857143) internal successors, (102), 26 states have internal predecessors, (102), 9 states have call successors, (44), 5 states have call predecessors, (44), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2024-11-08 23:23:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:55,103 INFO L93 Difference]: Finished difference Result 1911 states and 2579 transitions. [2024-11-08 23:23:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-08 23:23:55,103 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.642857142857143) internal successors, (102), 26 states have internal predecessors, (102), 9 states have call successors, (44), 5 states have call predecessors, (44), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) Word has length 196 [2024-11-08 23:23:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:55,110 INFO L225 Difference]: With dead ends: 1911 [2024-11-08 23:23:55,110 INFO L226 Difference]: Without dead ends: 1392 [2024-11-08 23:23:55,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4887 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3027, Invalid=11015, Unknown=0, NotChecked=0, Total=14042 [2024-11-08 23:23:55,115 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1043 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:23:55,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1416 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 23:23:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-08 23:23:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 740. [2024-11-08 23:23:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 565 states have (on average 1.3061946902654866) internal successors, (738), 571 states have internal predecessors, (738), 136 states have call successors, (136), 38 states have call predecessors, (136), 38 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-08 23:23:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1010 transitions. [2024-11-08 23:23:55,209 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1010 transitions. Word has length 196 [2024-11-08 23:23:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:55,210 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1010 transitions. [2024-11-08 23:23:55,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.642857142857143) internal successors, (102), 26 states have internal predecessors, (102), 9 states have call successors, (44), 5 states have call predecessors, (44), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2024-11-08 23:23:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1010 transitions. [2024-11-08 23:23:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:23:55,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:55,214 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, 1, 1, 1] [2024-11-08 23:23:55,229 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-08 23:23:55,417 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-08 23:23:55,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:55,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1737792577, now seen corresponding path program 1 times [2024-11-08 23:23:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:55,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77025142] [2024-11-08 23:23:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:23:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:23:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:23:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:23:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:23:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:23:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:23:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:23:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:23:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:23:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:23:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:23:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:23:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:23:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:23:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:23:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:23:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:23:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:23:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:23:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:23:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:23:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:23:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:23:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:23:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:23:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:23:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:23:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:23:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:55,742 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-08 23:23:55,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:23:55,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77025142] [2024-11-08 23:23:55,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77025142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:23:55,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:23:55,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:23:55,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332427662] [2024-11-08 23:23:55,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:23:55,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:23:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:23:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:23:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:23:55,745 INFO L87 Difference]: Start difference. First operand 740 states and 1010 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-08 23:23:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:23:55,979 INFO L93 Difference]: Finished difference Result 1417 states and 1926 transitions. [2024-11-08 23:23:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:23:55,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 196 [2024-11-08 23:23:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:23:55,984 INFO L225 Difference]: With dead ends: 1417 [2024-11-08 23:23:55,984 INFO L226 Difference]: Without dead ends: 688 [2024-11-08 23:23:55,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-08 23:23:55,987 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 110 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:23:55,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 498 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:23:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-08 23:23:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 588. [2024-11-08 23:23:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 445 states have (on average 1.2988764044943821) internal successors, (578), 449 states have internal predecessors, (578), 112 states have call successors, (112), 30 states have call predecessors, (112), 30 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 23:23:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 802 transitions. [2024-11-08 23:23:56,063 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 802 transitions. Word has length 196 [2024-11-08 23:23:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:23:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 802 transitions. [2024-11-08 23:23:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-08 23:23:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 802 transitions. [2024-11-08 23:23:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:23:56,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:23:56,066 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, 1, 1, 1] [2024-11-08 23:23:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:23:56,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:23:56,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:23:56,066 INFO L85 PathProgramCache]: Analyzing trace with hash 753466192, now seen corresponding path program 1 times [2024-11-08 23:23:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:23:56,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574295306] [2024-11-08 23:23:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:23:56,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323101382] [2024-11-08 23:23:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:23:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:23:56,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:23:56,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:23:56,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:23:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:56,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:23:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:56,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:23:56,440 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:23:56,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:23:56,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:23:56,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:23:56,650 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:23:56,763 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:23:56,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:23:56 BoogieIcfgContainer [2024-11-08 23:23:56,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:23:56,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:23:56,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:23:56,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:23:56,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:23:41" (3/4) ... [2024-11-08 23:23:56,769 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:23:56,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:23:56,770 INFO L158 Benchmark]: Toolchain (without parser) took 16349.29ms. Allocated memory was 159.4MB in the beginning and 606.1MB in the end (delta: 446.7MB). Free memory was 87.2MB in the beginning and 444.4MB in the end (delta: -357.2MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-11-08 23:23:56,770 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 110.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:23:56,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.95ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 68.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:23:56,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.40ms. Allocated memory is still 159.4MB. Free memory was 68.0MB in the beginning and 62.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:23:56,771 INFO L158 Benchmark]: Boogie Preprocessor took 155.43ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 62.0MB in the beginning and 172.6MB in the end (delta: -110.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-08 23:23:56,771 INFO L158 Benchmark]: RCFGBuilder took 617.88ms. Allocated memory is still 211.8MB. Free memory was 172.6MB in the beginning and 133.8MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 23:23:56,771 INFO L158 Benchmark]: TraceAbstraction took 15175.72ms. Allocated memory was 211.8MB in the beginning and 606.1MB in the end (delta: 394.3MB). Free memory was 133.8MB in the beginning and 444.4MB in the end (delta: -310.6MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2024-11-08 23:23:56,771 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 606.1MB. Free memory is still 444.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:23:56,772 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.18ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 110.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.95ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 68.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.40ms. Allocated memory is still 159.4MB. Free memory was 68.0MB in the beginning and 62.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 155.43ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 62.0MB in the beginning and 172.6MB in the end (delta: -110.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * RCFGBuilder took 617.88ms. Allocated memory is still 211.8MB. Free memory was 172.6MB in the beginning and 133.8MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15175.72ms. Allocated memory was 211.8MB in the beginning and 606.1MB in the end (delta: 394.3MB). Free memory was 133.8MB in the beginning and 444.4MB in the end (delta: -310.6MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 606.1MB. Free memory is still 444.4MB. 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 200, overapproximation of someBinaryFLOATComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed short int var_1_8 = -16; [L28] signed long int var_1_12 = -10; [L29] double var_1_14 = 127.8; [L30] double var_1_15 = 1.375; [L31] unsigned char var_1_19 = 1; [L32] float var_1_20 = 10.4; [L33] float var_1_21 = 3.075; [L34] double var_1_22 = 64.375; [L35] signed char var_1_23 = 16; [L36] signed char var_1_24 = 64; [L37] signed char var_1_25 = 0; [L38] double var_1_26 = 255.125; [L39] unsigned short int var_1_27 = 128; [L40] unsigned char var_1_28 = 1; [L41] unsigned short int var_1_29 = 128; [L42] unsigned short int var_1_30 = 49567; [L43] unsigned short int var_1_31 = 100; [L44] unsigned short int var_1_32 = 0; [L45] unsigned short int var_1_33 = 1; [L46] unsigned short int var_1_34 = 4; [L47] unsigned short int var_1_35 = 0; [L48] unsigned long int var_1_36 = 16; [L49] signed short int last_1_var_1_8 = -16; [L50] signed long int last_1_var_1_12 = -10; [L51] float last_1_var_1_20 = 10.4; [L52] signed char last_1_var_1_23 = 16; [L53] unsigned char last_1_var_1_28 = 1; [L54] unsigned short int last_1_var_1_29 = 128; [L55] unsigned long int last_1_var_1_36 = 16; VAL [isInitial=0, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L204] isInitial = 1 [L205] FCALL initially() [L206] int k_loop; [L207] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L207] COND TRUE k_loop < 1 [L208] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_12 = var_1_12 [L193] last_1_var_1_20 = var_1_20 [L194] last_1_var_1_23 = var_1_23 [L195] last_1_var_1_28 = var_1_28 [L196] last_1_var_1_29 = var_1_29 [L197] last_1_var_1_36 = var_1_36 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L148] var_1_5 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L149] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L151] var_1_6 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L152] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L153] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L153] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L155] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L156] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L156] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L158] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L160] var_1_15 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L161] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L163] var_1_21 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L164] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L165] var_1_24 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_24 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L166] RET assume_abort_if_not(var_1_24 >= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L168] var_1_25 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L171] var_1_30 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L172] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L174] var_1_31 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L177] var_1_32 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L178] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] CALL assume_abort_if_not(var_1_32 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] RET assume_abort_if_not(var_1_32 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L180] var_1_33 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L181] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L183] var_1_34 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L184] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L186] var_1_35 = __VERIFIER_nondet_ushort() [L187] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L187] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] CALL assume_abort_if_not(var_1_35 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] RET assume_abort_if_not(var_1_35 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L209] RET updateVariables() [L210] CALL step() [L59] signed long int stepLocal_7 = last_1_var_1_23 + var_1_24; [L60] signed long int stepLocal_6 = last_1_var_1_23; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L61] COND FALSE !(\read(var_1_7)) [L70] var_1_28 = 0 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L72] unsigned char stepLocal_5 = var_1_21 != last_1_var_1_20; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_5=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L73] COND FALSE !((var_1_6 || last_1_var_1_28) && stepLocal_5) [L76] var_1_23 = (var_1_25 - var_1_24) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L78] COND FALSE !(\read(var_1_5)) [L81] var_1_26 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L83] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L84] COND FALSE !(\read(var_1_28)) [L87] var_1_8 = var_1_23 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L89] unsigned char stepLocal_3 = var_1_27 < (var_1_23 >> 25); [L90] unsigned short int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_3=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91] COND FALSE !(stepLocal_3 && var_1_6) [L98] var_1_19 = var_1_7 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L100] signed long int stepLocal_4 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_4=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L101] COND FALSE !(last_1_var_1_23 <= stepLocal_4) [L104] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L106] COND TRUE var_1_20 > var_1_15 [L107] var_1_22 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L109] COND TRUE var_1_20 < var_1_14 [L110] var_1_29 = ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] EXPR (var_1_23 * var_1_23) & var_1_8 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] signed long int stepLocal_1 = (var_1_23 * var_1_23) & var_1_8; [L115] COND TRUE (var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L116] COND TRUE var_1_14 >= (var_1_15 * var_1_22) [L117] var_1_12 = (var_1_23 + var_1_23) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L128] unsigned char stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_0=0, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L129] COND FALSE !(stepLocal_0 || var_1_19) [L132] var_1_1 = (var_1_4 && ((var_1_5 || var_1_6) || var_1_7)) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L134] COND TRUE (var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36) [L135] var_1_36 = var_1_30 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L210] RET step() [L211] CALL, EXPR property() [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200-L201] return ((((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0)))) && ((var_1_20 < var_1_14) ? (var_1_29 == ((unsigned short int) ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))))) : (var_1_29 == ((unsigned short int) ((((var_1_24) > ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35))) ? (var_1_24) : ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35)))))))) && (((var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36)) ? (var_1_36 == ((unsigned long int) var_1_30)) : ((((var_1_28 || var_1_19) || var_1_7) && var_1_1) ? (var_1_36 == ((unsigned long int) var_1_31)) : (var_1_36 == ((unsigned long int) var_1_34)))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=-32769, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2328 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2313 mSDsluCounter, 5446 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3720 mSDsCounter, 559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2555 IncrementalHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 559 mSolverCounterUnsat, 1726 mSDtfsCounter, 2555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1364 GetRequests, 1212 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4898 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=740occurred in iteration=7, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 1019 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2344 NumberOfCodeBlocks, 2344 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2137 ConstructedInterpolants, 10 QuantifiedInterpolants, 6323 SizeOfPredicates, 9 NumberOfNonLiveVariables, 945 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 17261/17864 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-08 23:23:56,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.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 ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:23:59,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:23:59,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:23:59,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:23:59,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:23:59,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:23:59,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:23:59,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:23:59,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:23:59,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:23:59,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:23:59,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:23:59,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:23:59,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:23:59,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:23:59,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:23:59,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:23:59,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:23:59,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:23:59,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:23:59,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:23:59,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:23:59,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:23:59,205 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:23:59,205 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:23:59,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:23:59,205 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:23:59,205 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:23:59,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:23:59,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:23:59,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:23:59,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:23:59,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:23:59,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:23:59,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:23:59,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:23:59,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:23:59,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:23:59,208 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:23:59,208 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:23:59,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:23:59,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:23:59,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:23:59,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:23:59,210 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 -> ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 [2024-11-08 23:23:59,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:23:59,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:23:59,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:23:59,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:23:59,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:23:59,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-11-08 23:24:00,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:24:01,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:24:01,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-11-08 23:24:01,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940ef5fb6/8a86cbd9f8ad4bce8bda7edde84d46c8/FLAG6286716bf [2024-11-08 23:24:01,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940ef5fb6/8a86cbd9f8ad4bce8bda7edde84d46c8 [2024-11-08 23:24:01,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:24:01,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:24:01,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:24:01,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:24:01,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:24:01,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e81f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01, skipping insertion in model container [2024-11-08 23:24:01,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:24:01,340 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-1loop_file-72.i[916,929] [2024-11-08 23:24:01,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:24:01,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:24:01,454 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-1loop_file-72.i[916,929] [2024-11-08 23:24:01,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:24:01,524 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:24:01,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01 WrapperNode [2024-11-08 23:24:01,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:24:01,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:24:01,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:24:01,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:24:01,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,578 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-08 23:24:01,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:24:01,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:24:01,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:24:01,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:24:01,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,619 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-08 23:24:01,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:24:01,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:24:01,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:24:01,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:24:01,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (1/1) ... [2024-11-08 23:24:01,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:24:01,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:24:01,680 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-08 23:24:01,690 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-08 23:24:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:24:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:24:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:24:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:24:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:24:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:24:01,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:24:01,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:24:19,305 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 23:24:19,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:24:19,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:24:19,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:24:19,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:24:19 BoogieIcfgContainer [2024-11-08 23:24:19,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:24:19,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:24:19,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:24:19,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:24:19,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:24:01" (1/3) ... [2024-11-08 23:24:19,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264092fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:24:19, skipping insertion in model container [2024-11-08 23:24:19,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:01" (2/3) ... [2024-11-08 23:24:19,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264092fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:24:19, skipping insertion in model container [2024-11-08 23:24:19,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:24:19" (3/3) ... [2024-11-08 23:24:19,330 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-11-08 23:24:19,343 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:24:19,343 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:24:19,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:24:19,416 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;@39ac5036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:24:19,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:24:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 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-08 23:24:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 23:24:19,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:24:19,442 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] [2024-11-08 23:24:19,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:24:19,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:24:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1709521923, now seen corresponding path program 1 times [2024-11-08 23:24:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:24:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947364375] [2024-11-08 23:24:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:24:19,460 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-08 23:24:19,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:24:19,465 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-08 23:24:19,481 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-08 23:24:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:20,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:24:20,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:24:20,577 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-08 23:24:20,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:24:20,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:24:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947364375] [2024-11-08 23:24:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947364375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:24:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:24:20,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:24:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844551904] [2024-11-08 23:24:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:24:20,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:24:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:24:20,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:24:20,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:24:20,621 INFO L87 Difference]: Start difference. First operand has 87 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-08 23:24:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:24:20,651 INFO L93 Difference]: Finished difference Result 171 states and 296 transitions. [2024-11-08 23:24:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:24:20,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 187 [2024-11-08 23:24:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:24:20,661 INFO L225 Difference]: With dead ends: 171 [2024-11-08 23:24:20,661 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 23:24:20,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-08 23:24:20,667 INFO L432 NwaCegarLoop]: 132 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, 132 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-08 23:24:20,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:24:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 23:24:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 23:24:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 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-08 23:24:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-11-08 23:24:20,706 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 187 [2024-11-08 23:24:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:24:20,706 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-11-08 23:24:20,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-08 23:24:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-11-08 23:24:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 23:24:20,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:24:20,710 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] [2024-11-08 23:24:20,744 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-08 23:24:20,914 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-08 23:24:20,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:24:20,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:24:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2061572155, now seen corresponding path program 1 times [2024-11-08 23:24:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:24:20,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710385757] [2024-11-08 23:24:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:24:20,917 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-08 23:24:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:24:20,920 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-08 23:24:20,921 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-08 23:24:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:22,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:24:22,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:24:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2024-11-08 23:24:26,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:24:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 23:24:30,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:24:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710385757] [2024-11-08 23:24:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710385757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:24:30,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:24:30,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:24:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286390274] [2024-11-08 23:24:30,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:24:30,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:24:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:24:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:24:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:24:30,602 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-08 23:24:37,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:24:41,973 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-08 23:24:45,975 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-08 23:24:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:24:45,980 INFO L93 Difference]: Finished difference Result 171 states and 260 transitions. [2024-11-08 23:24:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:24:46,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 187 [2024-11-08 23:24:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:24:46,109 INFO L225 Difference]: With dead ends: 171 [2024-11-08 23:24:46,109 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 23:24:46,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:24:46,111 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 98 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:24:46,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 217 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time] [2024-11-08 23:24:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 23:24:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-08 23:24:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 23:24:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-11-08 23:24:46,121 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 187 [2024-11-08 23:24:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:24:46,122 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-11-08 23:24:46,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-08 23:24:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-11-08 23:24:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 23:24:46,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:24:46,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] [2024-11-08 23:24:46,155 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-08 23:24:46,328 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-08 23:24:46,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:24:46,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:24:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash 372628413, now seen corresponding path program 1 times [2024-11-08 23:24:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:24:46,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748289286] [2024-11-08 23:24:46,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:24:46,330 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-08 23:24:46,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:24:46,333 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-08 23:24:46,336 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-08 23:24:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:47,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:24:47,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:24:58,769 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-08 23:24:58,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:24:58,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:24:58,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748289286] [2024-11-08 23:24:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748289286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:24:58,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:24:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:24:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005683203] [2024-11-08 23:24:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:24:58,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:24:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:24:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:24:58,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:24:58,774 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-08 23:25:03,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:25:07,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:25:12,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []