./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-16.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_fillercode_fillercodesize_ps-cn-10_file-16.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 ea858c51937ec89962ca301a777c86650a3b12f6325f88fe47fa76e47d101c8d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:16:11,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:16:11,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:16:11,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:16:11,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:16:11,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:16:11,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:16:11,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:16:11,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:16:11,842 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:16:11,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:16:11,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:16:11,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:16:11,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:16:11,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:16:11,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:16:11,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:16:11,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:16:11,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:16:11,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:16:11,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:16:11,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:16:11,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:16:11,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:16:11,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:16:11,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:16:11,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:16:11,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:16:11,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:16:11,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:16:11,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:16:11,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:16:11,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:16:11,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:16:11,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:16:11,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:16:11,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:16:11,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:16:11,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:16:11,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:16:11,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:16:11,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:16:11,855 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 -> ea858c51937ec89962ca301a777c86650a3b12f6325f88fe47fa76e47d101c8d [2024-11-08 20:16:12,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:16:12,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:16:12,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:16:12,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:16:12,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:16:12,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-16.i [2024-11-08 20:16:13,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:16:13,914 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:16:13,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-16.i [2024-11-08 20:16:13,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c84c92e4/d9d7bcd7968542ecaa10287e55cb6393/FLAG84de825cd [2024-11-08 20:16:14,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c84c92e4/d9d7bcd7968542ecaa10287e55cb6393 [2024-11-08 20:16:14,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:16:14,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:16:14,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:16:14,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:16:14,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:16:14,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d46f1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14, skipping insertion in model container [2024-11-08 20:16:14,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:16:14,510 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_fillercode_fillercodesize_ps-cn-10_file-16.i[915,928] [2024-11-08 20:16:14,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:16:14,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:16:14,629 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_fillercode_fillercodesize_ps-cn-10_file-16.i[915,928] [2024-11-08 20:16:14,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:16:14,696 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:16:14,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14 WrapperNode [2024-11-08 20:16:14,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:16:14,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:16:14,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:16:14,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:16:14,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,767 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-08 20:16:14,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:16:14,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:16:14,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:16:14,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:16:14,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,814 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 20:16:14,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:16:14,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:16:14,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:16:14,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:16:14,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (1/1) ... [2024-11-08 20:16:14,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:16:14,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:16:14,892 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 20:16:14,896 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 20:16:14,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:16:14,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:16:14,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:16:14,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:16:14,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:16:14,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:16:15,041 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:16:15,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:16:15,519 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 20:16:15,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:16:15,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:16:15,540 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:16:15,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:16:15 BoogieIcfgContainer [2024-11-08 20:16:15,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:16:15,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:16:15,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:16:15,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:16:15,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:16:14" (1/3) ... [2024-11-08 20:16:15,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88bda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:16:15, skipping insertion in model container [2024-11-08 20:16:15,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:14" (2/3) ... [2024-11-08 20:16:15,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88bda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:16:15, skipping insertion in model container [2024-11-08 20:16:15,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:16:15" (3/3) ... [2024-11-08 20:16:15,553 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-16.i [2024-11-08 20:16:15,569 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:16:15,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:16:15,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:16:15,633 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;@2a1f16d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:16:15,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:16:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 64 states have internal predecessors, (86), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 20:16:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 20:16:15,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:15,660 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:15,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1521736452, now seen corresponding path program 1 times [2024-11-08 20:16:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973315417] [2024-11-08 20:16:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:15,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:16:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:16:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:16:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:16:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:16:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:16:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:16:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:16:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:16:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:16:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:16:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:16:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:16:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:16:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:16:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:16:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:16:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:16:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:16:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:16:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:16:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:16:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:16:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:16:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:16:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:16:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:16:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:16:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:16:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:16:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:16:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:16:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:16:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:16:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:16:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:16:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973315417] [2024-11-08 20:16:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973315417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:16,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:16:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676549022] [2024-11-08 20:16:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:16:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:16:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:16:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:16:16,390 INFO L87 Difference]: Start difference. First operand has 100 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 64 states have internal predecessors, (86), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 20:16:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:16,425 INFO L93 Difference]: Finished difference Result 193 states and 336 transitions. [2024-11-08 20:16:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:16:16,428 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 216 [2024-11-08 20:16:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:16,438 INFO L225 Difference]: With dead ends: 193 [2024-11-08 20:16:16,439 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 20:16:16,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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 20:16:16,450 INFO L432 NwaCegarLoop]: 147 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, 147 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 20:16:16,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:16:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 20:16:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 20:16:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 20:16:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-11-08 20:16:16,523 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 216 [2024-11-08 20:16:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:16,524 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-11-08 20:16:16,524 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 20:16:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-11-08 20:16:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 20:16:16,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:16,532 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:16,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:16:16,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:16,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1340243472, now seen corresponding path program 1 times [2024-11-08 20:16:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374159371] [2024-11-08 20:16:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:16:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:16:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:16:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:16:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:16:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:16:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:16:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:16:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:16:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:16:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:16:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:16:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:16:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:16:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:16:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:16:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:16:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:16:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:16:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:16:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:16:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:16:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:16:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:16:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:16:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:16:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:16:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:16:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:16:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:16:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:16:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:16:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:16:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:16:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:16:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:16:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374159371] [2024-11-08 20:16:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374159371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:17,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:16:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984733460] [2024-11-08 20:16:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:17,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:16:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:16:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:16:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:16:17,254 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:17,522 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2024-11-08 20:16:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:16:17,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-11-08 20:16:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:17,532 INFO L225 Difference]: With dead ends: 297 [2024-11-08 20:16:17,532 INFO L226 Difference]: Without dead ends: 204 [2024-11-08 20:16:17,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:16:17,536 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 185 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:17,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 560 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:16:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-08 20:16:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2024-11-08 20:16:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 110 states have internal predecessors, (153), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 20:16:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2024-11-08 20:16:17,577 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 216 [2024-11-08 20:16:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:17,578 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2024-11-08 20:16:17,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2024-11-08 20:16:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 20:16:17,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:17,583 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:17,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:16:17,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:17,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1366375922, now seen corresponding path program 1 times [2024-11-08 20:16:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:17,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12698852] [2024-11-08 20:16:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:17,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:16:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:16:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:16:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:16:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:16:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:16:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:16:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:16:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:16:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:16:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:16:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:16:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:16:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:16:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:16:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:16:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:16:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:16:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:16:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:16:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:16:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:16:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:16:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:16:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:16:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:16:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:16:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:16:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:16:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:16:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:16:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:16:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:16:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:16:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:16:18,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:16:18,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12698852] [2024-11-08 20:16:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12698852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:18,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:18,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:16:18,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566617212] [2024-11-08 20:16:18,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:16:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:16:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:16:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:16:18,027 INFO L87 Difference]: Start difference. First operand 148 states and 225 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:18,220 INFO L93 Difference]: Finished difference Result 370 states and 548 transitions. [2024-11-08 20:16:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:16:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-11-08 20:16:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:18,223 INFO L225 Difference]: With dead ends: 370 [2024-11-08 20:16:18,223 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 20:16:18,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:16:18,226 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 216 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:18,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 730 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:16:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 20:16:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2024-11-08 20:16:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 156 states have (on average 1.4102564102564104) internal successors, (220), 158 states have internal predecessors, (220), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:16:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 300 transitions. [2024-11-08 20:16:18,259 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 300 transitions. Word has length 216 [2024-11-08 20:16:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:18,261 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 300 transitions. [2024-11-08 20:16:18,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 300 transitions. [2024-11-08 20:16:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 20:16:18,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:18,268 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:18,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:16:18,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1624541360, now seen corresponding path program 1 times [2024-11-08 20:16:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:18,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898525308] [2024-11-08 20:16:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:18,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:16:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:16:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:16:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:16:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:16:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:16:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:16:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:16:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:16:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:16:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:16:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:16:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:16:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:16:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:16:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:16:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:16:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:16:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:16:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:16:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:16:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:16:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:16:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:16:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:16:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:16:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:16:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:16:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:16:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:16:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:16:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:16:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:16:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:16:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:16:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:16:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898525308] [2024-11-08 20:16:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898525308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:19,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:16:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117187479] [2024-11-08 20:16:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:19,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:16:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:16:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:16:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:16:19,163 INFO L87 Difference]: Start difference. First operand 201 states and 300 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:19,498 INFO L93 Difference]: Finished difference Result 501 states and 752 transitions. [2024-11-08 20:16:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:16:19,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-11-08 20:16:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:19,503 INFO L225 Difference]: With dead ends: 501 [2024-11-08 20:16:19,503 INFO L226 Difference]: Without dead ends: 303 [2024-11-08 20:16:19,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:16:19,505 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 86 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:19,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 479 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:16:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-08 20:16:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2024-11-08 20:16:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 235 states have (on average 1.4595744680851064) internal successors, (343), 237 states have internal predecessors, (343), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:16:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 423 transitions. [2024-11-08 20:16:19,525 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 423 transitions. Word has length 216 [2024-11-08 20:16:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:19,526 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 423 transitions. [2024-11-08 20:16:19,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 423 transitions. [2024-11-08 20:16:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 20:16:19,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:19,529 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:19,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:16:19,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:19,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash 960579118, now seen corresponding path program 1 times [2024-11-08 20:16:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306219557] [2024-11-08 20:16:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:16:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:16:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:16:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:16:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:16:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:16:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:16:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:16:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:16:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:16:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:16:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:16:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:16:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:16:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:16:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:16:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:16:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:16:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:16:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:16:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:16:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:16:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:16:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:16:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:16:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:16:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:16:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:16:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:16:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:16:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:16:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:16:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:16:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:16:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:16:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:16:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306219557] [2024-11-08 20:16:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306219557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:20,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 20:16:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317371277] [2024-11-08 20:16:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:20,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:16:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:16:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:16:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:16:20,568 INFO L87 Difference]: Start difference. First operand 280 states and 423 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:20,817 INFO L93 Difference]: Finished difference Result 646 states and 968 transitions. [2024-11-08 20:16:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:16:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-11-08 20:16:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:20,820 INFO L225 Difference]: With dead ends: 646 [2024-11-08 20:16:20,821 INFO L226 Difference]: Without dead ends: 369 [2024-11-08 20:16:20,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:16:20,822 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 91 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:20,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 533 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:16:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-08 20:16:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 265. [2024-11-08 20:16:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 220 states have (on average 1.45) internal successors, (319), 222 states have internal predecessors, (319), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:16:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2024-11-08 20:16:20,841 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 216 [2024-11-08 20:16:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:20,841 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2024-11-08 20:16:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2024-11-08 20:16:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 20:16:20,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:20,845 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:16:20,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1794348199, now seen corresponding path program 1 times [2024-11-08 20:16:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177138847] [2024-11-08 20:16:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:16:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:16:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:16:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:16:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:16:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:16:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:16:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:16:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:16:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:16:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:16:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:16:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:16:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:16:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:16:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:16:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:16:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:16:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:16:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:16:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:16:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:16:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:16:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:16:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:16:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:16:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:16:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:16:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:16:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:16:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:16:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:16:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:16:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:16:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:16:21,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:16:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177138847] [2024-11-08 20:16:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177138847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:21,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:16:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605346346] [2024-11-08 20:16:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:21,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:16:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:16:21,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:16:21,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:16:21,301 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:21,543 INFO L93 Difference]: Finished difference Result 760 states and 1131 transitions. [2024-11-08 20:16:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:16:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2024-11-08 20:16:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:21,550 INFO L225 Difference]: With dead ends: 760 [2024-11-08 20:16:21,550 INFO L226 Difference]: Without dead ends: 498 [2024-11-08 20:16:21,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 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 20:16:21,553 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 121 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:21,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 545 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:16:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-08 20:16:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 434. [2024-11-08 20:16:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 345 states have (on average 1.4115942028985506) internal successors, (487), 349 states have internal predecessors, (487), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-08 20:16:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 647 transitions. [2024-11-08 20:16:21,595 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 647 transitions. Word has length 217 [2024-11-08 20:16:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:21,598 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 647 transitions. [2024-11-08 20:16:21,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 647 transitions. [2024-11-08 20:16:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 20:16:21,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:21,601 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:21,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:16:21,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1276968299, now seen corresponding path program 1 times [2024-11-08 20:16:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:21,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051105735] [2024-11-08 20:16:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:16:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:16:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:16:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:16:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:16:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:16:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:16:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:16:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:16:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:16:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:16:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:16:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:16:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:16:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:16:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:16:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:16:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:16:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:16:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:16:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:16:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:16:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:16:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:16:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:16:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:16:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:16:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:16:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:16:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:16:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:16:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:16:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:16:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:16:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-08 20:16:22,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:16:22,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051105735] [2024-11-08 20:16:22,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051105735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:16:22,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993065254] [2024-11-08 20:16:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:22,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:16:22,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:16:22,040 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 20:16:22,042 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 20:16:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:16:22,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:16:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 505 proven. 87 refuted. 0 times theorem prover too weak. 1652 trivial. 0 not checked. [2024-11-08 20:16:22,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:16:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-08 20:16:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993065254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:16:22,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:16:22,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-08 20:16:22,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105717960] [2024-11-08 20:16:22,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:16:22,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 20:16:22,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:16:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 20:16:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:16:22,973 INFO L87 Difference]: Start difference. First operand 434 states and 647 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 2 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2024-11-08 20:16:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:23,774 INFO L93 Difference]: Finished difference Result 947 states and 1382 transitions. [2024-11-08 20:16:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 20:16:23,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 2 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 218 [2024-11-08 20:16:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:23,781 INFO L225 Difference]: With dead ends: 947 [2024-11-08 20:16:23,781 INFO L226 Difference]: Without dead ends: 520 [2024-11-08 20:16:23,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 499 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2024-11-08 20:16:23,784 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 239 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:23,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 612 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:16:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-08 20:16:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 293. [2024-11-08 20:16:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 1.3888888888888888) internal successors, (300), 217 states have internal predecessors, (300), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 20:16:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 440 transitions. [2024-11-08 20:16:23,823 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 440 transitions. Word has length 218 [2024-11-08 20:16:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:23,825 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 440 transitions. [2024-11-08 20:16:23,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 2 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2024-11-08 20:16:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 440 transitions. [2024-11-08 20:16:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 20:16:23,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:23,829 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:23,848 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 20:16:24,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:16:24,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:24,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1135586455, now seen corresponding path program 1 times [2024-11-08 20:16:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:16:24,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520844241] [2024-11-08 20:16:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:16:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:16:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048475193] [2024-11-08 20:16:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:24,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:16:24,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:16:24,125 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 20:16:24,127 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 20:16:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:16:24,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:16:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:16:24,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:16:24,603 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:16:24,604 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:16:24,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:16:24,806 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,SelfDestructingSolverStorable7 [2024-11-08 20:16:24,810 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:16:24,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:16:24,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:16:24 BoogieIcfgContainer [2024-11-08 20:16:24,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:16:24,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:16:24,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:16:24,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:16:24,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:16:15" (3/4) ... [2024-11-08 20:16:24,965 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:16:24,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:16:24,967 INFO L158 Benchmark]: Toolchain (without parser) took 10692.07ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 121.0MB in the beginning and 187.7MB in the end (delta: -66.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-11-08 20:16:24,967 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:16:24,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.16ms. Allocated memory is still 157.3MB. Free memory was 120.1MB in the beginning and 104.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:16:24,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.25ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 101.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:16:24,968 INFO L158 Benchmark]: Boogie Preprocessor took 71.28ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 97.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:16:24,968 INFO L158 Benchmark]: RCFGBuilder took 691.90ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 109.1MB in the end (delta: -12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 20:16:24,969 INFO L158 Benchmark]: TraceAbstraction took 9417.52ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 108.1MB in the beginning and 187.7MB in the end (delta: -79.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2024-11-08 20:16:24,969 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 276.8MB. Free memory is still 187.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:16:24,970 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.78ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.16ms. Allocated memory is still 157.3MB. Free memory was 120.1MB in the beginning and 104.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.25ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 101.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.28ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 97.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 691.90ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 109.1MB in the end (delta: -12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9417.52ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 108.1MB in the beginning and 187.7MB in the end (delta: -79.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 276.8MB. Free memory is still 187.7MB. 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 someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someUnaryFLOAToperation at line 112, overapproximation of someBinaryArithmeticFLOAToperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] unsigned char var_1_4 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 8; [L27] unsigned short int var_1_8 = 256; [L28] signed long int var_1_9 = 2; [L29] signed long int var_1_10 = 1441729073; [L30] unsigned short int var_1_11 = 32; [L31] double var_1_12 = 7.6; [L32] double var_1_13 = 127.8; [L33] signed char var_1_14 = 32; [L34] signed char var_1_15 = 50; [L35] signed char var_1_16 = 0; [L36] signed char var_1_17 = 16; [L37] float var_1_18 = 0.4; [L38] unsigned char var_1_19 = 0; [L39] float var_1_20 = 24.4; [L40] float var_1_21 = 500.5; [L41] float var_1_22 = 99.324; [L42] unsigned short int var_1_23 = 128; [L43] unsigned char var_1_24 = 0; [L44] unsigned char var_1_25 = 100; [L45] double var_1_26 = 10.4; [L46] signed char var_1_27 = 8; [L47] signed char var_1_28 = -8; [L48] unsigned char var_1_29 = 1; [L49] unsigned char var_1_30 = 1; [L50] double var_1_31 = 0.625; [L51] unsigned short int var_1_32 = 1; [L52] signed long int var_1_33 = -1; [L53] double var_1_34 = 1.2; [L54] unsigned short int last_1_var_1_7 = 8; [L55] unsigned short int last_1_var_1_11 = 32; [L56] signed char last_1_var_1_14 = 32; [L57] unsigned short int last_1_var_1_23 = 128; VAL [isInitial=0, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L171] last_1_var_1_7 = var_1_7 [L172] last_1_var_1_11 = var_1_11 [L173] last_1_var_1_14 = var_1_14 [L174] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L116] var_1_4 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L117] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L118] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L118] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L119] var_1_5 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L120] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L121] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L122] var_1_6 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L123] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L124] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L125] var_1_8 = __VERIFIER_nondet_ushort() [L126] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L126] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L127] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L127] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L128] var_1_10 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L129] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L130] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L130] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L131] var_1_13 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L132] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L133] var_1_15 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L134] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L135] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L135] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L136] var_1_16 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L137] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L138] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L138] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L139] var_1_17 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L140] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L141] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L141] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L142] var_1_19 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L143] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L144] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L145] var_1_20 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L146] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L147] var_1_21 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L148] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L149] var_1_22 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L150] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=100, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L151] var_1_25 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L152] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L153] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L153] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=-8, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L154] var_1_28 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L155] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L156] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L156] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L157] var_1_30 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L158] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L159] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L159] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_32=1, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L160] var_1_32 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L161] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L162] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L162] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=-1, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L163] var_1_33 = __VERIFIER_nondet_long() [L164] CALL assume_abort_if_not(var_1_33 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L164] RET assume_abort_if_not(var_1_33 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L165] CALL assume_abort_if_not(var_1_33 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L165] RET assume_abort_if_not(var_1_33 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L166] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L166] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_34=6/5, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L167] var_1_34 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L168] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=52/5, var_1_27=8, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L185] RET updateVariables() [L186] CALL step() [L61] var_1_24 = var_1_25 [L62] var_1_26 = 0.1 [L63] var_1_27 = var_1_28 [L64] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L65] EXPR var_1_25 >> var_1_24 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=5/8, var_1_33=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L65] COND FALSE !((var_1_32 + (var_1_25 >> var_1_24)) >= (var_1_28 % var_1_33)) [L68] var_1_31 = var_1_34 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L70] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_0=32, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L71] COND FALSE !((last_1_var_1_23 / -50) >= stepLocal_0) [L78] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L80] COND FALSE !(var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L83] COND TRUE var_1_6 > 128 [L84] var_1_9 = (var_1_8 - (var_1_10 - var_1_1)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=-1073741792] [L86] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=-1073741792] [L86] signed long int stepLocal_2 = var_1_5 | var_1_6; [L87] COND FALSE !(((var_1_9 + var_1_23) * var_1_9) < stepLocal_2) [L92] var_1_11 = var_1_8 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=-1073741792] [L94] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_1=129, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=-1073741792] [L95] COND TRUE last_1_var_1_7 < stepLocal_1 [L96] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L98] unsigned short int stepLocal_4 = var_1_8; [L99] signed long int stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_3=-1073741792, stepLocal_4=32, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L100] COND FALSE !(stepLocal_3 < (- var_1_10)) [L105] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L107] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32, stepLocal_5=32, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L108] COND TRUE last_1_var_1_14 <= stepLocal_5 [L109] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L111] COND TRUE var_1_4 || var_1_19 [L112] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=4, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=4, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L177] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=4, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L177] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=4, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L177-L178] return (((((((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_9 < (- var_1_10)) ? ((var_1_8 <= var_1_9) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((last_1_var_1_14 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=4, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741824, var_1_11=32, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=4, var_1_19=1, var_1_1=0, var_1_23=128, var_1_24=0, var_1_25=0, var_1_26=1/10, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=2, var_1_32=0, var_1_33=2, var_1_34=2, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741792] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 8, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 944 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 938 mSDsluCounter, 3606 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2565 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1428 IncrementalHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 1041 mSDtfsCounter, 1428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1022 GetRequests, 960 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=6, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 498 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2169 NumberOfCodeBlocks, 2169 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1942 ConstructedInterpolants, 0 QuantifiedInterpolants, 4377 SizeOfPredicates, 4 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 19935/20196 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 20:16:25,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-16.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 ea858c51937ec89962ca301a777c86650a3b12f6325f88fe47fa76e47d101c8d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:16:27,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:16:27,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:16:27,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:16:27,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:16:27,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:16:27,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:16:27,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:16:27,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:16:27,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:16:27,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:16:27,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:16:27,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:16:27,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:16:27,469 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:16:27,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:16:27,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:16:27,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:16:27,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:16:27,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:16:27,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:16:27,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:16:27,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:16:27,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:16:27,477 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:16:27,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:16:27,477 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:16:27,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:16:27,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:16:27,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:16:27,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:16:27,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:16:27,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:16:27,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:16:27,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:16:27,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:16:27,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:16:27,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:16:27,480 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:16:27,480 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:16:27,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:16:27,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:16:27,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:16:27,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:16:27,481 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 -> ea858c51937ec89962ca301a777c86650a3b12f6325f88fe47fa76e47d101c8d [2024-11-08 20:16:27,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:16:27,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:16:27,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:16:27,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:16:27,852 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:16:27,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-16.i [2024-11-08 20:16:29,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:16:29,736 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:16:29,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-16.i [2024-11-08 20:16:29,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847f89df2/45820896943c4c19882c13489ba92240/FLAG5e5cc90b2 [2024-11-08 20:16:29,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847f89df2/45820896943c4c19882c13489ba92240 [2024-11-08 20:16:29,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:16:29,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:16:29,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:16:29,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:16:29,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:16:29,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:16:29" (1/1) ... [2024-11-08 20:16:29,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1959e029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:29, skipping insertion in model container [2024-11-08 20:16:29,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:16:29" (1/1) ... [2024-11-08 20:16:29,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:16:30,035 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_fillercode_fillercodesize_ps-cn-10_file-16.i[915,928] [2024-11-08 20:16:30,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:16:30,135 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:16:30,147 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_fillercode_fillercodesize_ps-cn-10_file-16.i[915,928] [2024-11-08 20:16:30,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:16:30,222 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:16:30,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30 WrapperNode [2024-11-08 20:16:30,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:16:30,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:16:30,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:16:30,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:16:30,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,292 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-08 20:16:30,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:16:30,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:16:30,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:16:30,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:16:30,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,337 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 20:16:30,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:16:30,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:16:30,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:16:30,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:16:30,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (1/1) ... [2024-11-08 20:16:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:16:30,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:16:30,417 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 20:16:30,422 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 20:16:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:16:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:16:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:16:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:16:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:16:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:16:30,573 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:16:30,577 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:16:32,464 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 20:16:32,464 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:16:32,482 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:16:32,482 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:16:32,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:16:32 BoogieIcfgContainer [2024-11-08 20:16:32,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:16:32,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:16:32,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:16:32,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:16:32,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:16:29" (1/3) ... [2024-11-08 20:16:32,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1ad680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:16:32, skipping insertion in model container [2024-11-08 20:16:32,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:30" (2/3) ... [2024-11-08 20:16:32,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1ad680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:16:32, skipping insertion in model container [2024-11-08 20:16:32,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:16:32" (3/3) ... [2024-11-08 20:16:32,491 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-16.i [2024-11-08 20:16:32,506 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:16:32,506 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:16:32,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:16:32,582 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;@72517746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:16:32,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:16:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 53 states have internal predecessors, (69), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 20:16:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 20:16:32,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:32,630 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:32,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:32,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1937958626, now seen corresponding path program 1 times [2024-11-08 20:16:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:32,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885599366] [2024-11-08 20:16:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:32,658 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 20:16:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:32,661 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 20:16:32,663 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 20:16:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:33,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:16:33,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:16:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2024-11-08 20:16:33,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:16:33,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:16:33,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885599366] [2024-11-08 20:16:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885599366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:33,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:33,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:16:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924052938] [2024-11-08 20:16:33,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:33,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:16:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:16:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:16:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:16:33,346 INFO L87 Difference]: Start difference. First operand has 89 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 53 states have internal predecessors, (69), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) 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, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 20:16:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:33,396 INFO L93 Difference]: Finished difference Result 171 states and 302 transitions. [2024-11-08 20:16:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:16:33,399 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, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2024-11-08 20:16:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:33,411 INFO L225 Difference]: With dead ends: 171 [2024-11-08 20:16:33,411 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 20:16:33,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 211 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 20:16:33,421 INFO L432 NwaCegarLoop]: 130 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, 130 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 20:16:33,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:16:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 20:16:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-08 20:16:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 20:16:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 130 transitions. [2024-11-08 20:16:33,492 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 130 transitions. Word has length 212 [2024-11-08 20:16:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:33,492 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 130 transitions. [2024-11-08 20:16:33,493 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, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 20:16:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 130 transitions. [2024-11-08 20:16:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 20:16:33,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:33,500 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:33,514 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 20:16:33,700 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 20:16:33,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1842024466, now seen corresponding path program 1 times [2024-11-08 20:16:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927742209] [2024-11-08 20:16:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:33,704 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 20:16:33,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:33,708 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 20:16:33,709 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 20:16:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:34,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:16:34,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:16:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 20:16:34,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:16:34,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:16:34,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927742209] [2024-11-08 20:16:34,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927742209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:34,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:34,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:16:34,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380505783] [2024-11-08 20:16:34,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:34,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:16:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:16:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:16:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:16:34,338 INFO L87 Difference]: Start difference. First operand 85 states and 130 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:35,518 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2024-11-08 20:16:35,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:16:35,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-11-08 20:16:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:35,528 INFO L225 Difference]: With dead ends: 188 [2024-11-08 20:16:35,529 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 20:16:35,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:16:35,531 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:35,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 246 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 20:16:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 20:16:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-08 20:16:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 20:16:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2024-11-08 20:16:35,546 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 212 [2024-11-08 20:16:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:35,548 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2024-11-08 20:16:35,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 20:16:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2024-11-08 20:16:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 20:16:35,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:35,553 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:35,568 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 20:16:35,753 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 20:16:35,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1840177424, now seen corresponding path program 1 times [2024-11-08 20:16:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120082819] [2024-11-08 20:16:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:35,757 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 20:16:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:35,759 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 20:16:35,760 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 20:16:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:36,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 20:16:36,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:17:34,090 WARN L286 SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)