./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.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_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/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_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/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_993ac716-6bdf-478a-a4ec-1303be569768/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 406fa70e547fbe706895109d7567f9108a5cd6147a3189c522defa5caa910d5d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:48,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:48,206 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:17:48,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:48,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:48,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:48,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:48,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:48,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:48,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:48,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:48,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:48,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:48,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:48,268 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:48,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:48,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:48,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:48,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:17:48,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:48,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:48,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:48,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:48,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:48,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:48,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:48,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:48,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:48,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:48,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:48,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:48,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:48,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:48,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:48,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:48,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:48,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:17:48,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:17:48,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:48,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:48,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:48,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:48,285 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_993ac716-6bdf-478a-a4ec-1303be569768/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_993ac716-6bdf-478a-a4ec-1303be569768/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 -> 406fa70e547fbe706895109d7567f9108a5cd6147a3189c522defa5caa910d5d [2024-10-31 22:17:48,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:48,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:48,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:48,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:48,657 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:48,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i Unable to find full path for "g++" [2024-10-31 22:17:50,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:51,084 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:51,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i [2024-10-31 22:17:51,094 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/data/bd59a5fe5/c30dc7b4208f4f7d828a54cd08215dd0/FLAGd7749a50c [2024-10-31 22:17:51,114 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/data/bd59a5fe5/c30dc7b4208f4f7d828a54cd08215dd0 [2024-10-31 22:17:51,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:51,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:51,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:51,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:51,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:51,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9fbe6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51, skipping insertion in model container [2024-10-31 22:17:51,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:51,384 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_993ac716-6bdf-478a-a4ec-1303be569768/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i[916,929] [2024-10-31 22:17:51,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:51,469 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:51,484 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_993ac716-6bdf-478a-a4ec-1303be569768/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i[916,929] [2024-10-31 22:17:51,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:51,543 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:51,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51 WrapperNode [2024-10-31 22:17:51,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:51,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:51,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:51,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:51,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,634 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 592 [2024-10-31 22:17:51,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:51,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:51,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:51,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:51,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,677 INFO L175 MemorySlicer]: Split 146 memory accesses to 15 slices as follows [2, 7, 6, 10, 10, 8, 8, 12, 9, 26, 16, 5, 9, 8, 10]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1]. [2024-10-31 22:17:51,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:51,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:51,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:51,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:51,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (1/1) ... [2024-10-31 22:17:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:51,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:51,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:51,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:17:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:17:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:17:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:17:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:17:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:17:51,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 22:17:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-31 22:17:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-31 22:17:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-31 22:17:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-31 22:17:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-31 22:17:51,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-31 22:17:51,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-31 22:17:51,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-31 22:17:51,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:17:51,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:17:51,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 22:17:51,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 22:17:51,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 22:17:51,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 22:17:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-31 22:17:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-31 22:17:51,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-31 22:17:51,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-31 22:17:51,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-31 22:17:51,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-31 22:17:51,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-31 22:17:51,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-31 22:17:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-31 22:17:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:17:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:17:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 22:17:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 22:17:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 22:17:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 22:17:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-31 22:17:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-31 22:17:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-31 22:17:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-31 22:17:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-31 22:17:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-31 22:17:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-31 22:17:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-31 22:17:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-31 22:17:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:17:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:17:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:17:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:17:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:17:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:17:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 22:17:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-31 22:17:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-31 22:17:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-31 22:17:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-31 22:17:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-31 22:17:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-31 22:17:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-31 22:17:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-31 22:17:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:17:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:17:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 22:17:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 22:17:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 22:17:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 22:17:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-31 22:17:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-31 22:17:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-31 22:17:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-31 22:17:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-31 22:17:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-31 22:17:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-31 22:17:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-31 22:17:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-31 22:17:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:17:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:17:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:17:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:17:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:17:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:17:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 22:17:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-31 22:17:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-31 22:17:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-31 22:17:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-31 22:17:51,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-31 22:17:51,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-31 22:17:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-31 22:17:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-31 22:17:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:51,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:52,138 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:52,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:52,975 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:52,975 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:53,003 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:53,005 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:53,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:53 BoogieIcfgContainer [2024-10-31 22:17:53,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:53,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:53,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:53,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:53,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:51" (1/3) ... [2024-10-31 22:17:53,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd96d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:53, skipping insertion in model container [2024-10-31 22:17:53,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:51" (2/3) ... [2024-10-31 22:17:53,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd96d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:53, skipping insertion in model container [2024-10-31 22:17:53,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:53" (3/3) ... [2024-10-31 22:17:53,021 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-25.i [2024-10-31 22:17:53,054 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:53,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:53,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:53,185 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;@713007, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:53,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-31 22:17:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:17:53,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:53,229 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:17:53,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:53,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1167224636, now seen corresponding path program 1 times [2024-10-31 22:17:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850384662] [2024-10-31 22:17:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:17:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850384662] [2024-10-31 22:17:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850384662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:53,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781131390] [2024-10-31 22:17:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:53,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:53,935 INFO L87 Difference]: Start difference. First operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-31 22:17:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:53,975 INFO L93 Difference]: Finished difference Result 241 states and 378 transitions. [2024-10-31 22:17:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:53,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2024-10-31 22:17:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:53,986 INFO L225 Difference]: With dead ends: 241 [2024-10-31 22:17:53,986 INFO L226 Difference]: Without dead ends: 120 [2024-10-31 22:17:53,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 22:17:53,997 INFO L432 NwaCegarLoop]: 176 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, 176 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 22:17:53,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-31 22:17:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-31 22:17:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-31 22:17:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-10-31 22:17:54,072 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2024-10-31 22:17:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:54,076 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-10-31 22:17:54,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-31 22:17:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-10-31 22:17:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:17:54,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:54,084 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:17:54,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:17:54,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:54,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1643043108, now seen corresponding path program 1 times [2024-10-31 22:17:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187412397] [2024-10-31 22:17:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:17:56,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187412397] [2024-10-31 22:17:56,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187412397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:56,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:56,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:17:56,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661381210] [2024-10-31 22:17:56,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:56,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:17:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:56,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:17:56,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:17:56,507 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-31 22:17:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:57,668 INFO L93 Difference]: Finished difference Result 343 states and 499 transitions. [2024-10-31 22:17:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:17:57,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2024-10-31 22:17:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:57,678 INFO L225 Difference]: With dead ends: 343 [2024-10-31 22:17:57,678 INFO L226 Difference]: Without dead ends: 226 [2024-10-31 22:17:57,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:17:57,681 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 360 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:57,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1172 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:17:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-31 22:17:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 197. [2024-10-31 22:17:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.391566265060241) internal successors, (231), 167 states have internal predecessors, (231), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 22:17:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2024-10-31 22:17:57,718 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 144 [2024-10-31 22:17:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:57,719 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2024-10-31 22:17:57,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-31 22:17:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2024-10-31 22:17:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-31 22:17:57,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:57,723 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:17:57,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:17:57,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:57,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1671490847, now seen corresponding path program 1 times [2024-10-31 22:17:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524846863] [2024-10-31 22:17:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:17:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:58,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524846863] [2024-10-31 22:17:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524846863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504850789] [2024-10-31 22:17:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:58,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:58,191 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:17:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:58,417 INFO L93 Difference]: Finished difference Result 455 states and 660 transitions. [2024-10-31 22:17:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-10-31 22:17:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:58,423 INFO L225 Difference]: With dead ends: 455 [2024-10-31 22:17:58,423 INFO L226 Difference]: Without dead ends: 261 [2024-10-31 22:17:58,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:58,426 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 158 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:58,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 827 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:17:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-31 22:17:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 252. [2024-10-31 22:17:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 201 states have (on average 1.3482587064676617) internal successors, (271), 203 states have internal predecessors, (271), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 22:17:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 363 transitions. [2024-10-31 22:17:58,475 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 363 transitions. Word has length 145 [2024-10-31 22:17:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:58,476 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 363 transitions. [2024-10-31 22:17:58,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:17:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 363 transitions. [2024-10-31 22:17:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:58,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:58,479 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:17:58,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:17:58,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:58,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1114350154, now seen corresponding path program 1 times [2024-10-31 22:17:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647390752] [2024-10-31 22:17:58,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:17:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647390752] [2024-10-31 22:17:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647390752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:58,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:58,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102241250] [2024-10-31 22:17:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:58,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:58,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:58,844 INFO L87 Difference]: Start difference. First operand 252 states and 363 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:17:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:58,925 INFO L93 Difference]: Finished difference Result 482 states and 697 transitions. [2024-10-31 22:17:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:58,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-10-31 22:17:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:58,932 INFO L225 Difference]: With dead ends: 482 [2024-10-31 22:17:58,932 INFO L226 Difference]: Without dead ends: 258 [2024-10-31 22:17:58,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:58,937 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:58,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-31 22:17:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2024-10-31 22:17:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 205 states have (on average 1.3414634146341464) internal successors, (275), 207 states have internal predecessors, (275), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 22:17:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 367 transitions. [2024-10-31 22:17:59,003 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 367 transitions. Word has length 146 [2024-10-31 22:17:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:59,004 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 367 transitions. [2024-10-31 22:17:59,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:17:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 367 transitions. [2024-10-31 22:17:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:59,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:59,008 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:17:59,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:17:59,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:59,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash 970184827, now seen corresponding path program 1 times [2024-10-31 22:17:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:59,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925546300] [2024-10-31 22:17:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:17:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925546300] [2024-10-31 22:17:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925546300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28647644] [2024-10-31 22:17:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:59,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:59,525 INFO L87 Difference]: Start difference. First operand 256 states and 367 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:17:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:59,749 INFO L93 Difference]: Finished difference Result 486 states and 699 transitions. [2024-10-31 22:17:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-10-31 22:17:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:59,752 INFO L225 Difference]: With dead ends: 486 [2024-10-31 22:17:59,752 INFO L226 Difference]: Without dead ends: 258 [2024-10-31 22:17:59,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:59,753 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 141 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:59,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 871 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:17:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-31 22:17:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2024-10-31 22:17:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 200 states have internal predecessors, (264), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 22:17:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 356 transitions. [2024-10-31 22:17:59,805 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 356 transitions. Word has length 148 [2024-10-31 22:17:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:59,806 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 356 transitions. [2024-10-31 22:17:59,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:17:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 356 transitions. [2024-10-31 22:17:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:59,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:59,808 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:17:59,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:17:59,808 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:59,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1203547643, now seen corresponding path program 1 times [2024-10-31 22:17:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036965492] [2024-10-31 22:17:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:18:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:18:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:18:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:18:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:18:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:18:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:18:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:18:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:18:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:18:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:18:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:18:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:18:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:18:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:18:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:18:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:18:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:18:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-31 22:18:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036965492] [2024-10-31 22:18:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036965492] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:18:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459402426] [2024-10-31 22:18:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:00,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:00,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:00,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:18:00,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:18:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:01,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-31 22:18:01,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:01,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:18:01,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-31 22:18:01,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:18:01,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-31 22:18:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:18:01,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:18:02,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-10-31 22:18:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-31 22:18:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459402426] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:18:02,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:18:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 15 [2024-10-31 22:18:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282484267] [2024-10-31 22:18:02,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:18:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-31 22:18:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-31 22:18:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:18:02,557 INFO L87 Difference]: Start difference. First operand 249 states and 356 transitions. Second operand has 15 states, 11 states have (on average 6.909090909090909) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 3 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-31 22:18:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:03,876 INFO L93 Difference]: Finished difference Result 612 states and 869 transitions. [2024-10-31 22:18:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-31 22:18:03,877 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 6.909090909090909) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 3 states have call predecessors, (38), 6 states have call successors, (38) Word has length 148 [2024-10-31 22:18:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:03,880 INFO L225 Difference]: With dead ends: 612 [2024-10-31 22:18:03,880 INFO L226 Difference]: Without dead ends: 391 [2024-10-31 22:18:03,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 322 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2024-10-31 22:18:03,882 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1157 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:03,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 919 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:18:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-31 22:18:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 259. [2024-10-31 22:18:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 206 states have (on average 1.3203883495145632) internal successors, (272), 208 states have internal predecessors, (272), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 22:18:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 364 transitions. [2024-10-31 22:18:03,936 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 364 transitions. Word has length 148 [2024-10-31 22:18:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:03,937 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 364 transitions. [2024-10-31 22:18:03,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 6.909090909090909) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 3 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-31 22:18:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2024-10-31 22:18:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-31 22:18:03,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:03,939 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:18:03,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:18:04,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-31 22:18:04,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:04,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash -370742344, now seen corresponding path program 1 times [2024-10-31 22:18:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:04,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745538582] [2024-10-31 22:18:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:18:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:18:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:18:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:18:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:18:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:18:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:18:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:18:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:18:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:18:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:18:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:18:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:18:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:18:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:18:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:18:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:18:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:18:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:18:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745538582] [2024-10-31 22:18:04,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745538582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:04,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:04,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:18:04,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836976515] [2024-10-31 22:18:04,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:04,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:18:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:18:04,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:18:04,769 INFO L87 Difference]: Start difference. First operand 259 states and 364 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:04,954 INFO L93 Difference]: Finished difference Result 552 states and 777 transitions. [2024-10-31 22:18:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-10-31 22:18:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:04,957 INFO L225 Difference]: With dead ends: 552 [2024-10-31 22:18:04,957 INFO L226 Difference]: Without dead ends: 321 [2024-10-31 22:18:04,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:04,960 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 93 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:04,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1072 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-31 22:18:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-10-31 22:18:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 262 states have (on average 1.3396946564885497) internal successors, (351), 265 states have internal predecessors, (351), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:18:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2024-10-31 22:18:05,026 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 149 [2024-10-31 22:18:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:05,027 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2024-10-31 22:18:05,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2024-10-31 22:18:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-31 22:18:05,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:05,031 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:18:05,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:18:05,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:05,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -656501539, now seen corresponding path program 1 times [2024-10-31 22:18:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007267101] [2024-10-31 22:18:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:18:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:18:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:18:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:18:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:18:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:18:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:18:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:18:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:18:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:18:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:18:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:18:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:18:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:18:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:18:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:18:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:18:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:18:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:18:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:06,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007267101] [2024-10-31 22:18:06,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007267101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:06,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:06,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:18:06,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226829638] [2024-10-31 22:18:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:06,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:18:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:18:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:18:06,672 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:07,296 INFO L93 Difference]: Finished difference Result 680 states and 956 transitions. [2024-10-31 22:18:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 22:18:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-10-31 22:18:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:07,300 INFO L225 Difference]: With dead ends: 680 [2024-10-31 22:18:07,301 INFO L226 Difference]: Without dead ends: 390 [2024-10-31 22:18:07,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:18:07,302 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 103 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:07,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2112 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:18:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-31 22:18:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 342. [2024-10-31 22:18:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 286 states have (on average 1.3496503496503496) internal successors, (386), 289 states have internal predecessors, (386), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:18:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 482 transitions. [2024-10-31 22:18:07,360 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 482 transitions. Word has length 151 [2024-10-31 22:18:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:07,361 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 482 transitions. [2024-10-31 22:18:07,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 482 transitions. [2024-10-31 22:18:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-31 22:18:07,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:07,364 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:18:07,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:18:07,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:07,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1243307553, now seen corresponding path program 1 times [2024-10-31 22:18:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:07,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334925689] [2024-10-31 22:18:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:18:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:18:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:18:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:18:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:18:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:18:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:18:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:18:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:18:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:18:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:18:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:18:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:18:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:18:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:18:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:18:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:18:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:18:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:18:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334925689] [2024-10-31 22:18:08,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334925689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:08,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:08,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:18:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485478935] [2024-10-31 22:18:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:08,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:18:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:08,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:18:08,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:08,402 INFO L87 Difference]: Start difference. First operand 342 states and 482 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:08,698 INFO L93 Difference]: Finished difference Result 697 states and 982 transitions. [2024-10-31 22:18:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:18:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-10-31 22:18:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:08,701 INFO L225 Difference]: With dead ends: 697 [2024-10-31 22:18:08,701 INFO L226 Difference]: Without dead ends: 383 [2024-10-31 22:18:08,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:18:08,703 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 95 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:08,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1460 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-31 22:18:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 338. [2024-10-31 22:18:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 282 states have (on average 1.3475177304964538) internal successors, (380), 285 states have internal predecessors, (380), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:18:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 476 transitions. [2024-10-31 22:18:08,752 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 476 transitions. Word has length 151 [2024-10-31 22:18:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:08,753 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 476 transitions. [2024-10-31 22:18:08,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 476 transitions. [2024-10-31 22:18:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-31 22:18:08,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:08,755 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:18:08,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:18:08,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1266726495, now seen corresponding path program 1 times [2024-10-31 22:18:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629625285] [2024-10-31 22:18:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:18:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:18:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:18:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:18:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:18:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:18:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:18:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:18:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:18:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:18:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:18:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:18:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:18:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:18:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:18:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:18:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:18:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:18:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:18:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:09,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629625285] [2024-10-31 22:18:09,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629625285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:09,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:09,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:18:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013906226] [2024-10-31 22:18:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:18:09,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:09,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:18:09,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:09,710 INFO L87 Difference]: Start difference. First operand 338 states and 476 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:09,976 INFO L93 Difference]: Finished difference Result 659 states and 923 transitions. [2024-10-31 22:18:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:18:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-10-31 22:18:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:09,979 INFO L225 Difference]: With dead ends: 659 [2024-10-31 22:18:09,979 INFO L226 Difference]: Without dead ends: 349 [2024-10-31 22:18:09,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:18:09,981 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 98 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:09,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1040 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-31 22:18:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 304. [2024-10-31 22:18:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 249 states have (on average 1.3293172690763053) internal successors, (331), 251 states have internal predecessors, (331), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 22:18:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 423 transitions. [2024-10-31 22:18:10,036 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 423 transitions. Word has length 151 [2024-10-31 22:18:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:10,037 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 423 transitions. [2024-10-31 22:18:10,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 423 transitions. [2024-10-31 22:18:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-31 22:18:10,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:10,040 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:18:10,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:18:10,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:10,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 679920481, now seen corresponding path program 1 times [2024-10-31 22:18:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:10,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448968664] [2024-10-31 22:18:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:10,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:18:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:18:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:18:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:18:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:18:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:18:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:18:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:18:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:18:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:18:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:18:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:18:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:18:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:18:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:18:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:18:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:18:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:18:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:18:11,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:11,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448968664] [2024-10-31 22:18:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448968664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:11,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:11,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:18:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125230116] [2024-10-31 22:18:11,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:11,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:18:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:11,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:18:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:18:11,470 INFO L87 Difference]: Start difference. First operand 304 states and 423 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:12,205 INFO L93 Difference]: Finished difference Result 632 states and 878 transitions. [2024-10-31 22:18:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 22:18:12,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-10-31 22:18:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:12,208 INFO L225 Difference]: With dead ends: 632 [2024-10-31 22:18:12,208 INFO L226 Difference]: Without dead ends: 360 [2024-10-31 22:18:12,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:18:12,213 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 83 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 2456 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:12,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 2456 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:18:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-31 22:18:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 351. [2024-10-31 22:18:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 290 states have (on average 1.3310344827586207) internal successors, (386), 293 states have internal predecessors, (386), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-31 22:18:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 486 transitions. [2024-10-31 22:18:12,284 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 486 transitions. Word has length 151 [2024-10-31 22:18:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:12,285 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 486 transitions. [2024-10-31 22:18:12,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:18:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 486 transitions. [2024-10-31 22:18:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-31 22:18:12,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:12,288 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:18:12,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:18:12,289 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:12,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1935355510, now seen corresponding path program 1 times [2024-10-31 22:18:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:12,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318018] [2024-10-31 22:18:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:18:12,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:18:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:18:12,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:18:12,659 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:18:12,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:18:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:18:12,665 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:12,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:18:12,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:18:12 BoogieIcfgContainer [2024-10-31 22:18:12,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:18:12,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:18:12,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:18:12,938 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:18:12,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:53" (3/4) ... [2024-10-31 22:18:12,941 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:18:12,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:18:12,943 INFO L158 Benchmark]: Toolchain (without parser) took 21823.18ms. Allocated memory was 155.2MB in the beginning and 474.0MB in the end (delta: 318.8MB). Free memory was 117.4MB in the beginning and 429.5MB in the end (delta: -312.1MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-10-31 22:18:12,943 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 155.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:18:12,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.23ms. Allocated memory is still 155.2MB. Free memory was 117.4MB in the beginning and 101.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:18:12,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.08ms. Allocated memory is still 155.2MB. Free memory was 101.1MB in the beginning and 97.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:18:12,944 INFO L158 Benchmark]: Boogie Preprocessor took 113.21ms. Allocated memory is still 155.2MB. Free memory was 97.0MB in the beginning and 91.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:18:12,945 INFO L158 Benchmark]: RCFGBuilder took 1256.90ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 91.2MB in the beginning and 132.3MB in the end (delta: -41.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-10-31 22:18:12,945 INFO L158 Benchmark]: TraceAbstraction took 19927.13ms. Allocated memory was 186.6MB in the beginning and 474.0MB in the end (delta: 287.3MB). Free memory was 131.2MB in the beginning and 430.5MB in the end (delta: -299.3MB). Peak memory consumption was 265.1MB. Max. memory is 16.1GB. [2024-10-31 22:18:12,946 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 474.0MB. Free memory was 430.5MB in the beginning and 429.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:18:12,947 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.33ms. Allocated memory is still 155.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.23ms. Allocated memory is still 155.2MB. Free memory was 117.4MB in the beginning and 101.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.08ms. Allocated memory is still 155.2MB. Free memory was 101.1MB in the beginning and 97.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.21ms. Allocated memory is still 155.2MB. Free memory was 97.0MB in the beginning and 91.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1256.90ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 91.2MB in the beginning and 132.3MB in the end (delta: -41.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19927.13ms. Allocated memory was 186.6MB in the beginning and 474.0MB in the end (delta: 287.3MB). Free memory was 131.2MB in the beginning and 430.5MB in the end (delta: -299.3MB). Peak memory consumption was 265.1MB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 474.0MB. Free memory was 430.5MB in the beginning and 429.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L22] unsigned long int var_1_1 = 256; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 10; [L26] unsigned short int var_1_3 = 10; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned short int var_1_4 = 500; [L28] unsigned short int var_1_4 = 500; [L29] unsigned short int* var_1_4_Pointer = &(var_1_4); [L30] unsigned long int var_1_5 = 0; [L30] unsigned long int var_1_5 = 0; [L31] unsigned long int* var_1_5_Pointer = &(var_1_5); [L32] unsigned long int var_1_6 = 1509114200; [L32] unsigned long int var_1_6 = 1509114200; [L33] unsigned long int* var_1_6_Pointer = &(var_1_6); [L34] unsigned long int var_1_7 = 10; [L34] unsigned long int var_1_7 = 10; [L35] unsigned long int* var_1_7_Pointer = &(var_1_7); [L36] float var_1_8 = 128.9; [L36] float var_1_8 = 128.9; [L37] float* var_1_8_Pointer = &(var_1_8); [L38] float var_1_9 = 63.363; [L38] float var_1_9 = 63.363; [L39] float* var_1_9_Pointer = &(var_1_9); [L40] float var_1_10 = 4.575; [L40] float var_1_10 = 4.575; [L41] float* var_1_10_Pointer = &(var_1_10); [L42] float var_1_11 = 25.5; [L42] float var_1_11 = 25.5; [L43] float* var_1_11_Pointer = &(var_1_11); [L44] unsigned char var_1_12 = 1; [L44] unsigned char var_1_12 = 1; [L45] unsigned char* var_1_12_Pointer = &(var_1_12); [L46] unsigned char var_1_13 = 0; [L46] unsigned char var_1_13 = 0; [L47] unsigned char* var_1_13_Pointer = &(var_1_13); [L48] unsigned char var_1_14 = 1; [L48] unsigned char var_1_14 = 1; [L49] unsigned char* var_1_14_Pointer = &(var_1_14); VAL [isInitial=0, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] FCALL updateLastVariables() [L125] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] var_1_3 = __VERIFIER_nondet_ushort() [L89] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] var_1_4 = __VERIFIER_nondet_ushort() [L92] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] var_1_6 = __VERIFIER_nondet_ulong() [L98] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L100] var_1_7 = __VERIFIER_nondet_ulong() [L101] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] var_1_9 = __VERIFIER_nondet_float() [L104] EXPR \read(var_1_9) [L104] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L104] EXPR \read(var_1_9) [L104] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] var_1_10 = __VERIFIER_nondet_float() [L106] EXPR \read(var_1_10) [L106] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L106] EXPR \read(var_1_10) [L106] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] var_1_13 = __VERIFIER_nondet_uchar() [L108] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] var_1_14 = __VERIFIER_nondet_uchar() [L111] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L111] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L111] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L125] RET updateVariables() [L126] CALL step() [L53] EXPR \read(*var_1_9_Pointer) [L53] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L53] COND FALSE !((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) [L60] EXPR \read(*var_1_14_Pointer) [L60] (*(var_1_12_Pointer)) = (*(var_1_14_Pointer)) [L62] EXPR \read(*var_1_3_Pointer) [L62] unsigned short int stepLocal_0 = (*(var_1_3_Pointer)); [L63] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L63] COND TRUE (*(var_1_12_Pointer)) [L64] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L64] COND FALSE !(stepLocal_0 <= (*(var_1_4_Pointer))) [L70] EXPR \read(*var_1_1_Pointer) [L70] unsigned long int stepLocal_1 = (*(var_1_1_Pointer)); [L71] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L71] COND TRUE (*(var_1_7_Pointer)) >= stepLocal_1 [L72] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L72] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) [L72] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L72] (*(var_1_8_Pointer)) = ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))) [L76] EXPR \read(*var_1_10_Pointer) [L76] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] EXPR ((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer))) [L76] EXPR ((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] EXPR ((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer))) [L76] EXPR \read(*var_1_8_Pointer) [L76] EXPR ((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] COND TRUE (*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer))))) [L77] EXPR \read(*var_1_10_Pointer) [L77] (*(var_1_11_Pointer)) = (*(var_1_10_Pointer)) [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) [L117] EXPR \read(*var_1_3_Pointer) [L117] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1 [L117] EXPR ((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1 VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) [L117] EXPR \read(*var_1_7_Pointer) [L117] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) [L117] EXPR \read(*var_1_8_Pointer) [L117] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) [L117] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1))) && (((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) || (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1))) && (((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) || (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117-L118] return ((((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1))) && (((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) || (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2288 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2288 mSDsluCounter, 12787 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10361 mSDsCounter, 327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1785 IncrementalHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 327 mSolverCounterUnsat, 2426 mSDtfsCounter, 1785 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 726 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=11, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 331 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 1927 NumberOfCodeBlocks, 1927 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1911 ConstructedInterpolants, 0 QuantifiedInterpolants, 8236 SizeOfPredicates, 10 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 7819/7956 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 22:18:12,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/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_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/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 406fa70e547fbe706895109d7567f9108a5cd6147a3189c522defa5caa910d5d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:18:15,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:18:15,557 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:18:15,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:18:15,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:18:15,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:18:15,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:18:15,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:18:15,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:18:15,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:18:15,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:18:15,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:18:15,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:18:15,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:18:15,618 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:18:15,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:18:15,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:18:15,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:18:15,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:18:15,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:18:15,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:18:15,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:18:15,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:18:15,627 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:18:15,627 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:18:15,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:18:15,628 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:18:15,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:18:15,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:18:15,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:18:15,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:18:15,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:18:15,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:18:15,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:18:15,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:15,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:18:15,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:18:15,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:18:15,633 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:18:15,634 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:18:15,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:18:15,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:18:15,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:18:15,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:18:15,635 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:18:15,636 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_993ac716-6bdf-478a-a4ec-1303be569768/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_993ac716-6bdf-478a-a4ec-1303be569768/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 -> 406fa70e547fbe706895109d7567f9108a5cd6147a3189c522defa5caa910d5d [2024-10-31 22:18:16,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:18:16,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:18:16,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:18:16,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:18:16,102 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:18:16,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_993ac716-6bdf-478a-a4ec-1303be569768/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i