./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU --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 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:20,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:20,666 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:20,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:20,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:20,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:20,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:20,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:20,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:20,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:20,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:20,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:20,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:20,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:20,706 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:20,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:20,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:20,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:20,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:20,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:20,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:20,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:20,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:20,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:20,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:20,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:20,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:20,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:20,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:20,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:20,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:20,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:20,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:20,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:20,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:20,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:20,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:20,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:20,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:20,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:20,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:20,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:20,716 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e [2024-10-31 21:57:21,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:21,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:21,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:21,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:21,066 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:21,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i Unable to find full path for "g++" [2024-10-31 21:57:23,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:23,290 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:23,292 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i [2024-10-31 21:57:23,304 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/data/25d3b136c/3ca043a1ab794933a3b56929557de85b/FLAGc98e369c5 [2024-10-31 21:57:23,320 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/data/25d3b136c/3ca043a1ab794933a3b56929557de85b [2024-10-31 21:57:23,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:23,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:23,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:23,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:23,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:23,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:23,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133ee2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23, skipping insertion in model container [2024-10-31 21:57:23,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:23,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:23,640 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i[916,929] [2024-10-31 21:57:23,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:23,770 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:23,782 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i[916,929] [2024-10-31 21:57:23,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:23,857 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:23,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23 WrapperNode [2024-10-31 21:57:23,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:23,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:23,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:23,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:23,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:23,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:23,959 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-10-31 21:57:23,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:23,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:23,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:23,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:23,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:23,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:23,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,002 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 21:57:24,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:24,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:24,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:24,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:24,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (1/1) ... [2024-10-31 21:57:24,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:24,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:24,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:24,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:24,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:24,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:24,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:24,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:24,266 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:24,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:25,000 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:25,000 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:25,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:25,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:25,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:25 BoogieIcfgContainer [2024-10-31 21:57:25,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:25,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:25,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:25,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:25,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:23" (1/3) ... [2024-10-31 21:57:25,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c78b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:25, skipping insertion in model container [2024-10-31 21:57:25,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:23" (2/3) ... [2024-10-31 21:57:25,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c78b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:25, skipping insertion in model container [2024-10-31 21:57:25,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:25" (3/3) ... [2024-10-31 21:57:25,041 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-80.i [2024-10-31 21:57:25,061 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:25,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:25,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:25,146 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;@3e1fab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:25,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 21:57:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-31 21:57:25,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:25,168 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:25,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1673297695, now seen corresponding path program 1 times [2024-10-31 21:57:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869974001] [2024-10-31 21:57:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:57:25,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:25,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869974001] [2024-10-31 21:57:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869974001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:25,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:25,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957611409] [2024-10-31 21:57:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:25,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:25,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:25,897 INFO L87 Difference]: Start difference. First operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:25,946 INFO L93 Difference]: Finished difference Result 199 states and 337 transitions. [2024-10-31 21:57:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:25,949 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 161 [2024-10-31 21:57:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:25,963 INFO L225 Difference]: With dead ends: 199 [2024-10-31 21:57:25,964 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 21:57:25,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:25,972 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:25,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 21:57:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-31 21:57:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 21:57:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-10-31 21:57:26,053 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 161 [2024-10-31 21:57:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:26,054 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-10-31 21:57:26,056 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-10-31 21:57:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-31 21:57:26,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:26,064 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:26,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash -450312811, now seen corresponding path program 1 times [2024-10-31 21:57:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016738635] [2024-10-31 21:57:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:57:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016738635] [2024-10-31 21:57:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016738635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:26,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:26,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352437837] [2024-10-31 21:57:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:57:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:57:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:26,573 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:57:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:26,672 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2024-10-31 21:57:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:57:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2024-10-31 21:57:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:26,679 INFO L225 Difference]: With dead ends: 245 [2024-10-31 21:57:26,679 INFO L226 Difference]: Without dead ends: 149 [2024-10-31 21:57:26,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-10-31 21:57:26,681 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 77 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:26,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-31 21:57:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-10-31 21:57:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 119 states have internal predecessors, (171), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 21:57:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2024-10-31 21:57:26,714 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 161 [2024-10-31 21:57:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:26,715 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2024-10-31 21:57:26,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 21:57:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2024-10-31 21:57:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-31 21:57:26,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:26,719 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:26,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:26,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:26,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash 691721377, now seen corresponding path program 1 times [2024-10-31 21:57:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39835842] [2024-10-31 21:57:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:57:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39835842] [2024-10-31 21:57:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39835842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:28,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 21:57:28,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059840021] [2024-10-31 21:57:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:28,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 21:57:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:57:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:57:28,468 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:30,433 INFO L93 Difference]: Finished difference Result 582 states and 882 transitions. [2024-10-31 21:57:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 21:57:30,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-10-31 21:57:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:30,445 INFO L225 Difference]: With dead ends: 582 [2024-10-31 21:57:30,445 INFO L226 Difference]: Without dead ends: 439 [2024-10-31 21:57:30,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-31 21:57:30,452 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 589 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:30,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1097 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-31 21:57:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-31 21:57:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 237. [2024-10-31 21:57:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 183 states have (on average 1.4316939890710383) internal successors, (262), 184 states have internal predecessors, (262), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 21:57:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 358 transitions. [2024-10-31 21:57:30,499 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 358 transitions. Word has length 162 [2024-10-31 21:57:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:30,501 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 358 transitions. [2024-10-31 21:57:30,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 358 transitions. [2024-10-31 21:57:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-31 21:57:30,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:30,505 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:57:30,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:30,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash 182248287, now seen corresponding path program 1 times [2024-10-31 21:57:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979758941] [2024-10-31 21:57:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:57:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979758941] [2024-10-31 21:57:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979758941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 21:57:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502166550] [2024-10-31 21:57:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:31,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 21:57:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:31,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:57:31,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:57:31,854 INFO L87 Difference]: Start difference. First operand 237 states and 358 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:35,042 INFO L93 Difference]: Finished difference Result 694 states and 1050 transitions. [2024-10-31 21:57:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 21:57:35,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-10-31 21:57:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:35,047 INFO L225 Difference]: With dead ends: 694 [2024-10-31 21:57:35,048 INFO L226 Difference]: Without dead ends: 551 [2024-10-31 21:57:35,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-31 21:57:35,051 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 529 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:35,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1561 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-31 21:57:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-31 21:57:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 237. [2024-10-31 21:57:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 183 states have (on average 1.4316939890710383) internal successors, (262), 184 states have internal predecessors, (262), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 21:57:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 358 transitions. [2024-10-31 21:57:35,127 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 358 transitions. Word has length 162 [2024-10-31 21:57:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:35,130 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 358 transitions. [2024-10-31 21:57:35,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 358 transitions. [2024-10-31 21:57:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-31 21:57:35,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:35,136 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:35,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:57:35,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:35,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash -986425596, now seen corresponding path program 1 times [2024-10-31 21:57:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478101323] [2024-10-31 21:57:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 21:57:36,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:36,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478101323] [2024-10-31 21:57:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478101323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:36,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 21:57:36,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604873366] [2024-10-31 21:57:36,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:36,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 21:57:36,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:36,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 21:57:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:57:36,381 INFO L87 Difference]: Start difference. First operand 237 states and 358 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:37,579 INFO L93 Difference]: Finished difference Result 545 states and 829 transitions. [2024-10-31 21:57:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 21:57:37,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 163 [2024-10-31 21:57:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:37,583 INFO L225 Difference]: With dead ends: 545 [2024-10-31 21:57:37,584 INFO L226 Difference]: Without dead ends: 402 [2024-10-31 21:57:37,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-10-31 21:57:37,586 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 618 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:37,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 905 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 21:57:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-31 21:57:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 272. [2024-10-31 21:57:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 218 states have (on average 1.463302752293578) internal successors, (319), 219 states have internal predecessors, (319), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 21:57:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 415 transitions. [2024-10-31 21:57:37,653 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 415 transitions. Word has length 163 [2024-10-31 21:57:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:37,654 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 415 transitions. [2024-10-31 21:57:37,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 21:57:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 415 transitions. [2024-10-31 21:57:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-31 21:57:37,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:37,658 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:37,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:57:37,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:37,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash 354724942, now seen corresponding path program 1 times [2024-10-31 21:57:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453400501] [2024-10-31 21:57:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-31 21:57:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453400501] [2024-10-31 21:57:38,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453400501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:57:38,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586285413] [2024-10-31 21:57:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:38,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:38,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:57:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:38,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 21:57:38,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-31 21:57:39,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:57:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-31 21:57:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586285413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:57:39,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:57:39,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-31 21:57:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023760848] [2024-10-31 21:57:39,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:57:39,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:57:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:57:39,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:39,444 INFO L87 Difference]: Start difference. First operand 272 states and 415 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-31 21:57:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:39,795 INFO L93 Difference]: Finished difference Result 492 states and 747 transitions. [2024-10-31 21:57:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 163 [2024-10-31 21:57:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:39,799 INFO L225 Difference]: With dead ends: 492 [2024-10-31 21:57:39,799 INFO L226 Difference]: Without dead ends: 281 [2024-10-31 21:57:39,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:57:39,801 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 78 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:39,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 339 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-31 21:57:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-10-31 21:57:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 221 states have (on average 1.411764705882353) internal successors, (312), 222 states have internal predecessors, (312), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 21:57:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 408 transitions. [2024-10-31 21:57:39,846 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 408 transitions. Word has length 163 [2024-10-31 21:57:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:39,847 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 408 transitions. [2024-10-31 21:57:39,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-31 21:57:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 408 transitions. [2024-10-31 21:57:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-31 21:57:39,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:39,851 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:39,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 21:57:40,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-31 21:57:40,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:40,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1270070702, now seen corresponding path program 1 times [2024-10-31 21:57:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:40,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630037478] [2024-10-31 21:57:40,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:40,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-31 21:57:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630037478] [2024-10-31 21:57:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630037478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:57:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342441515] [2024-10-31 21:57:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:40,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:40,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:40,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:40,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 21:57:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 21:57:40,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-10-31 21:57:41,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:57:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-31 21:57:41,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342441515] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:57:41,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:57:41,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-31 21:57:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034436654] [2024-10-31 21:57:41,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:57:41,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:57:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:57:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:41,587 INFO L87 Difference]: Start difference. First operand 277 states and 408 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-31 21:57:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:41,881 INFO L93 Difference]: Finished difference Result 427 states and 620 transitions. [2024-10-31 21:57:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 163 [2024-10-31 21:57:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:41,886 INFO L225 Difference]: With dead ends: 427 [2024-10-31 21:57:41,886 INFO L226 Difference]: Without dead ends: 213 [2024-10-31 21:57:41,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:57:41,889 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:41,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 287 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-31 21:57:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-10-31 21:57:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 21:57:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2024-10-31 21:57:41,944 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 163 [2024-10-31 21:57:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:41,945 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2024-10-31 21:57:41,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-31 21:57:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2024-10-31 21:57:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-31 21:57:41,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:41,949 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:41,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 21:57:42,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-31 21:57:42,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:42,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash -530368202, now seen corresponding path program 1 times [2024-10-31 21:57:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726720445] [2024-10-31 21:57:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 21:57:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 21:57:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:57:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:57:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 21:57:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-31 21:57:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-31 21:57:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-31 21:57:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 21:57:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-31 21:57:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 21:57:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-31 21:57:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:43,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 21:57:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:43,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 21:57:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 12 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-10-31 21:57:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726720445] [2024-10-31 21:57:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726720445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:57:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657166996] [2024-10-31 21:57:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:43,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:43,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:43,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:43,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 21:57:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:43,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 21:57:43,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 411 proven. 12 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-31 21:57:43,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:57:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-31 21:57:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657166996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:57:44,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:57:44,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-31 21:57:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690827244] [2024-10-31 21:57:44,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:57:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-31 21:57:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-31 21:57:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-31 21:57:44,163 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-31 21:57:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:45,081 INFO L93 Difference]: Finished difference Result 464 states and 629 transitions. [2024-10-31 21:57:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-31 21:57:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 165 [2024-10-31 21:57:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:45,085 INFO L225 Difference]: With dead ends: 464 [2024-10-31 21:57:45,086 INFO L226 Difference]: Without dead ends: 355 [2024-10-31 21:57:45,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2024-10-31 21:57:45,088 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 472 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:45,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 577 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:57:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-31 21:57:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 227. [2024-10-31 21:57:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 167 states have (on average 1.2754491017964071) internal successors, (213), 167 states have internal predecessors, (213), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 21:57:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 305 transitions. [2024-10-31 21:57:45,153 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 305 transitions. Word has length 165 [2024-10-31 21:57:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:45,154 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 305 transitions. [2024-10-31 21:57:45,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-31 21:57:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 305 transitions. [2024-10-31 21:57:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-31 21:57:45,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:45,158 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:45,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-31 21:57:45,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-31 21:57:45,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:45,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:45,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1810231880, now seen corresponding path program 1 times [2024-10-31 21:57:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:45,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804148772] [2024-10-31 21:57:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 21:57:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599577336] [2024-10-31 21:57:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:45,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:45,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:45,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 21:57:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:45,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:57:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:46,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:57:46,095 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:57:46,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:57:46,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-31 21:57:46,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:46,303 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:46,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:57:46,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:57:46 BoogieIcfgContainer [2024-10-31 21:57:46,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:57:46,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:57:46,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:57:46,455 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:57:46,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:25" (3/4) ... [2024-10-31 21:57:46,458 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:57:46,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:57:46,460 INFO L158 Benchmark]: Toolchain (without parser) took 23136.74ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 126.6MB in the beginning and 229.8MB in the end (delta: -103.2MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:46,461 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 111.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:46,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.80ms. Allocated memory is still 165.7MB. Free memory was 126.6MB in the beginning and 108.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 21:57:46,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.49ms. Allocated memory is still 165.7MB. Free memory was 108.6MB in the beginning and 104.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:46,462 INFO L158 Benchmark]: Boogie Preprocessor took 71.08ms. Allocated memory is still 165.7MB. Free memory was 104.4MB in the beginning and 98.6MB in the end (delta: 5.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:46,462 INFO L158 Benchmark]: RCFGBuilder took 993.11ms. Allocated memory is still 165.7MB. Free memory was 98.2MB in the beginning and 113.1MB in the end (delta: -14.9MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-31 21:57:46,462 INFO L158 Benchmark]: TraceAbstraction took 21423.64ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 111.9MB in the beginning and 229.8MB in the end (delta: -117.9MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:46,462 INFO L158 Benchmark]: Witness Printer took 5.46ms. Allocated memory is still 310.4MB. Free memory is still 229.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:46,464 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.31ms. Allocated memory is still 111.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.80ms. Allocated memory is still 165.7MB. Free memory was 126.6MB in the beginning and 108.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.49ms. Allocated memory is still 165.7MB. Free memory was 108.6MB in the beginning and 104.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.08ms. Allocated memory is still 165.7MB. Free memory was 104.4MB in the beginning and 98.6MB in the end (delta: 5.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 993.11ms. Allocated memory is still 165.7MB. Free memory was 98.2MB in the beginning and 113.1MB in the end (delta: -14.9MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21423.64ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 111.9MB in the beginning and 229.8MB in the end (delta: -117.9MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 5.46ms. Allocated memory is still 310.4MB. Free memory is still 229.8MB. 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 188, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryArithmeticFLOAToperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.8; [L23] float var_1_6 = 16.375; [L24] float var_1_7 = 0.25; [L25] unsigned char var_1_8 = 1; [L26] unsigned char var_1_9 = 1; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 128; [L29] double var_1_13 = 255.5; [L30] double var_1_14 = 0.0; [L31] double var_1_15 = 0.0; [L32] double var_1_16 = 100.3; [L33] unsigned long int var_1_17 = 32; [L34] unsigned short int var_1_19 = 100; [L35] double var_1_21 = 10000000000.5; [L36] double var_1_22 = 32.2; [L37] signed short int var_1_23 = -2; [L38] signed char var_1_24 = 32; [L39] signed char var_1_25 = 10; [L40] signed char var_1_26 = -128; [L41] double var_1_27 = 5.8; [L42] unsigned short int var_1_28 = 16; [L43] unsigned char var_1_30 = 1; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned long int var_1_33 = 256; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 3.625; [L49] float var_1_36 = 9.8; [L50] unsigned char var_1_37 = 4; [L51] unsigned long int last_1_var_1_17 = 32; [L52] double last_1_var_1_22 = 32.2; [L53] double last_1_var_1_27 = 5.8; [L54] unsigned char last_1_var_1_37 = 4; VAL [isInitial=0, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L182] last_1_var_1_17 = var_1_17 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_37 = var_1_37 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L146] var_1_7 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L154] var_1_14 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L156] var_1_15 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L158] var_1_16 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L160] var_1_24 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L163] var_1_25 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L166] var_1_26 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L173] var_1_33 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_33 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] RET assume_abort_if_not(var_1_33 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L177] var_1_34 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L196] RET updateVariables() [L197] CALL step() [L58] COND TRUE (- last_1_var_1_27) < var_1_7 [L59] var_1_21 = 0.19999999999999996 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L63] COND TRUE ((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16) [L64] var_1_28 = ((var_1_25 + (100 + 64)) + last_1_var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L68] COND TRUE \read(var_1_9) [L69] var_1_11 = 0u VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L79] COND TRUE \read(var_1_9) [L80] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L82] var_1_35 = var_1_16 [L83] var_1_36 = var_1_14 [L84] var_1_37 = var_1_25 [L85] unsigned long int stepLocal_0 = 1u; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L86] COND FALSE !(((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L91] signed long int stepLocal_4 = (var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4))); VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_4=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L92] COND TRUE stepLocal_4 > var_1_37 [L93] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L95] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L96] COND FALSE !(var_1_28 <= stepLocal_3) [L99] var_1_19 = ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L101] signed long int stepLocal_2 = var_1_19 - var_1_19; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L102] COND TRUE \read(var_1_9) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L103] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] EXPR (last_1_var_1_17 / -64) << var_1_11 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] COND TRUE ((last_1_var_1_17 / -64) << var_1_11) >= stepLocal_2 [L105] var_1_17 = var_1_19 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] EXPR var_1_37 ^ (4u / var_1_33) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] COND FALSE !((var_1_37 ^ (4u / var_1_33)) != var_1_17) [L116] var_1_32 = (var_1_31 || var_1_34) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L118] COND FALSE !(((var_1_16 * var_1_6) > var_1_15) && var_1_32) [L121] var_1_22 = ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L123] COND TRUE ((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23 [L124] var_1_1 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L126] signed long int stepLocal_5 = var_1_19 + var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L127] COND TRUE var_1_28 != stepLocal_5 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L128] COND TRUE var_1_1 < var_1_21 [L129] var_1_27 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L132] unsigned short int stepLocal_1 = var_1_28; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L133] COND TRUE var_1_7 != (var_1_27 * var_1_6) [L134] var_1_13 = ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188] EXPR (((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34)))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188-L189] return ((((((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34))))) && (var_1_35 == ((float) var_1_16))) && (var_1_36 == ((float) var_1_14))) && (var_1_37 == ((unsigned char) var_1_25)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 9, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2469 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2445 mSDsluCounter, 5189 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3920 mSDsCounter, 714 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3210 IncrementalHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 714 mSolverCounterUnsat, 1269 mSDtfsCounter, 3210 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1476 GetRequests, 1375 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=6, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 785 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2121 NumberOfCodeBlocks, 2121 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2268 ConstructedInterpolants, 0 QuantifiedInterpolants, 8021 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 13787/14168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 21:57:46,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974a180-6e0e-4c9f-8489-c3efc0fada6f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...