./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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_ca7c949e-b915-4431-8d73-016905a9153a/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 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:01:14,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:01:14,622 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:01:14,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:01:14,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:01:14,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:01:14,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:01:14,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:01:14,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:01:14,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:01:14,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:01:14,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:01:14,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:01:14,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:01:14,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:01:14,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:01:14,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:01:14,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:01:14,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:01:14,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:01:14,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:01:14,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:01:14,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:01:14,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:01:14,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:01:14,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:01:14,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:01:14,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:01:14,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:01:14,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:01:14,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:01:14,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:01:14,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:14,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:01:14,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:01:14,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:01:14,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:01:14,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:01:14,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:01:14,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:01:14,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:01:14,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:01:14,685 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_ca7c949e-b915-4431-8d73-016905a9153a/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_ca7c949e-b915-4431-8d73-016905a9153a/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 -> 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 [2024-10-31 22:01:14,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:01:15,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:01:15,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:01:15,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:01:15,014 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:01:15,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i Unable to find full path for "g++" [2024-10-31 22:01:16,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:01:17,259 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:01:17,260 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i [2024-10-31 22:01:17,270 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data/85654894b/7fb86148748a4860aa9f3b92b49b12f7/FLAG9f43133db [2024-10-31 22:01:17,589 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data/85654894b/7fb86148748a4860aa9f3b92b49b12f7 [2024-10-31 22:01:17,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:01:17,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:01:17,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:17,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:01:17,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:01:17,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:17,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d561df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17, skipping insertion in model container [2024-10-31 22:01:17,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:17,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:01:17,833 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_ca7c949e-b915-4431-8d73-016905a9153a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i[916,929] [2024-10-31 22:01:17,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:17,903 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:01:17,913 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_ca7c949e-b915-4431-8d73-016905a9153a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i[916,929] [2024-10-31 22:01:17,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:17,979 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:01:17,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17 WrapperNode [2024-10-31 22:01:17,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:17,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:17,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:01:17,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:01:17,990 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:01:17" (1/1) ... [2024-10-31 22:01:18,003 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:01:17" (1/1) ... [2024-10-31 22:01:18,047 INFO L138 Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2024-10-31 22:01:18,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:18,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:01:18,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:01:18,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:01:18,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,107 INFO L175 MemorySlicer]: Split 115 memory accesses to 12 slices as follows [2, 9, 35, 8, 7, 14, 5, 6, 6, 8, 9, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1]. [2024-10-31 22:01:18,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:01:18,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:01:18,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:01:18,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:01:18,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (1/1) ... [2024-10-31 22:01:18,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:18,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:18,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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:01:18,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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:01:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-31 22:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:01:18,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:01:18,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 22:01:18,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-31 22:01:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-31 22:01:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-31 22:01:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-31 22:01:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-31 22:01:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:01:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:01:18,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 22:01:18,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 22:01:18,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 22:01:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 22:01:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-31 22:01:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-31 22:01:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-31 22:01:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-31 22:01:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-31 22:01:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-31 22:01:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-31 22:01:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-31 22:01:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-31 22:01:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-31 22:01:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:01:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:01:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 22:01:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 22:01:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 22:01:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 22:01:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-31 22:01:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-31 22:01:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-31 22:01:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-31 22:01:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-31 22:01:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-31 22:01:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:01:18,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:01:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:01:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:01:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:01:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:01:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-31 22:01:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:01:18,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:01:18,509 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:01:18,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:01:19,158 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-31 22:01:19,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:01:19,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:01:19,181 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:01:19,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:19 BoogieIcfgContainer [2024-10-31 22:01:19,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:01:19,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:01:19,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:01:19,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:01:19,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:01:17" (1/3) ... [2024-10-31 22:01:19,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ef5ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:19, skipping insertion in model container [2024-10-31 22:01:19,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:17" (2/3) ... [2024-10-31 22:01:19,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ef5ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:19, skipping insertion in model container [2024-10-31 22:01:19,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:19" (3/3) ... [2024-10-31 22:01:19,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-42.i [2024-10-31 22:01:19,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:01:19,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:01:19,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:01:19,316 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;@1f106f8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:01:19,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:01:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:19,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:19,337 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:19,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:19,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash 990451809, now seen corresponding path program 1 times [2024-10-31 22:01:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:19,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739555471] [2024-10-31 22:01:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:19,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:19,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739555471] [2024-10-31 22:01:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739555471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050144187] [2024-10-31 22:01:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:19,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:01:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:19,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:01:19,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:01:19,921 INFO L87 Difference]: Start difference. First operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:01:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:19,960 INFO L93 Difference]: Finished difference Result 193 states and 293 transitions. [2024-10-31 22:01:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:01:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-31 22:01:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:19,972 INFO L225 Difference]: With dead ends: 193 [2024-10-31 22:01:19,972 INFO L226 Difference]: Without dead ends: 96 [2024-10-31 22:01:19,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:01:19,983 INFO L432 NwaCegarLoop]: 135 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, 135 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:01:19,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-31 22:01:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-31 22:01:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-31 22:01:20,053 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2024-10-31 22:01:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:20,054 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-31 22:01:20,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:01:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-31 22:01:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:20,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:20,059 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:20,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:01:20,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:20,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -214908817, now seen corresponding path program 1 times [2024-10-31 22:01:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:20,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729154019] [2024-10-31 22:01:20,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:20,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:20,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729154019] [2024-10-31 22:01:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729154019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:20,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:20,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:20,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867901228] [2024-10-31 22:01:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:20,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:20,474 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:01:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:20,552 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2024-10-31 22:01:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:20,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-31 22:01:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:20,555 INFO L225 Difference]: With dead ends: 191 [2024-10-31 22:01:20,555 INFO L226 Difference]: Without dead ends: 98 [2024-10-31 22:01:20,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:20,557 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:20,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-31 22:01:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-31 22:01:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-10-31 22:01:20,581 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 103 [2024-10-31 22:01:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:20,586 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-10-31 22:01:20,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:01:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-10-31 22:01:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:20,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:20,590 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:20,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:01:20,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:20,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1743665969, now seen corresponding path program 1 times [2024-10-31 22:01:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:20,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801223935] [2024-10-31 22:01:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801223935] [2024-10-31 22:01:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801223935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821548381] [2024-10-31 22:01:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:21,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:21,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:21,463 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:21,527 INFO L93 Difference]: Finished difference Result 193 states and 271 transitions. [2024-10-31 22:01:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:01:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:21,530 INFO L225 Difference]: With dead ends: 193 [2024-10-31 22:01:21,530 INFO L226 Difference]: Without dead ends: 98 [2024-10-31 22:01:21,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:21,532 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:21,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-31 22:01:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-31 22:01:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-10-31 22:01:21,542 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 103 [2024-10-31 22:01:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:21,542 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-10-31 22:01:21,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-10-31 22:01:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:21,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:21,545 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:21,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:01:21,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:21,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1884214579, now seen corresponding path program 1 times [2024-10-31 22:01:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874256395] [2024-10-31 22:01:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:22,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874256395] [2024-10-31 22:01:22,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874256395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:22,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:22,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928235802] [2024-10-31 22:01:22,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:22,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:22,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:22,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:22,242 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:22,339 INFO L93 Difference]: Finished difference Result 193 states and 269 transitions. [2024-10-31 22:01:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:22,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:01:22,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:22,342 INFO L225 Difference]: With dead ends: 193 [2024-10-31 22:01:22,342 INFO L226 Difference]: Without dead ends: 98 [2024-10-31 22:01:22,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:22,347 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:22,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-31 22:01:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-31 22:01:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-10-31 22:01:22,369 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 103 [2024-10-31 22:01:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:22,369 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-10-31 22:01:22,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-10-31 22:01:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:22,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:22,372 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:22,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:01:22,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:22,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash 873097329, now seen corresponding path program 1 times [2024-10-31 22:01:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:22,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451600086] [2024-10-31 22:01:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:23,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:23,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451600086] [2024-10-31 22:01:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451600086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:23,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:23,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:01:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143175114] [2024-10-31 22:01:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:23,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:01:23,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:23,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:01:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:01:23,199 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:23,363 INFO L93 Difference]: Finished difference Result 197 states and 272 transitions. [2024-10-31 22:01:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:01:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:01:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:23,366 INFO L225 Difference]: With dead ends: 197 [2024-10-31 22:01:23,366 INFO L226 Difference]: Without dead ends: 102 [2024-10-31 22:01:23,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:01:23,367 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:23,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 485 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-31 22:01:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-10-31 22:01:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-10-31 22:01:23,381 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 103 [2024-10-31 22:01:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:23,382 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-10-31 22:01:23,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-10-31 22:01:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:23,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:23,384 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:23,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:01:23,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:23,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1574161907, now seen corresponding path program 1 times [2024-10-31 22:01:23,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:23,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413751293] [2024-10-31 22:01:23,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-31 22:01:24,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413751293] [2024-10-31 22:01:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413751293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505951629] [2024-10-31 22:01:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:24,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:24,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:01:24,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:01:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-31 22:01:24,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:24,517 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 15 [2024-10-31 22:01:24,541 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:01:24,634 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 11 treesize of output 7 [2024-10-31 22:01:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:24,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:01:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505951629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:24,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 22:01:24,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2024-10-31 22:01:24,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024337684] [2024-10-31 22:01:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:24,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:01:24,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:01:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:01:24,889 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:25,407 INFO L93 Difference]: Finished difference Result 332 states and 457 transitions. [2024-10-31 22:01:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:01:25,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:01:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:25,409 INFO L225 Difference]: With dead ends: 332 [2024-10-31 22:01:25,410 INFO L226 Difference]: Without dead ends: 235 [2024-10-31 22:01:25,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-31 22:01:25,411 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 246 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:25,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1029 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:01:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-31 22:01:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 120. [2024-10-31 22:01:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2024-10-31 22:01:25,429 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 103 [2024-10-31 22:01:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:25,430 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2024-10-31 22:01:25,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2024-10-31 22:01:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:25,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:25,432 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:25,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:01:25,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-31 22:01:25,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:25,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash 502934860, now seen corresponding path program 1 times [2024-10-31 22:01:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667991330] [2024-10-31 22:01:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667991330] [2024-10-31 22:01:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667991330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:25,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:25,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599000184] [2024-10-31 22:01:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:25,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:25,985 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:26,034 INFO L93 Difference]: Finished difference Result 235 states and 324 transitions. [2024-10-31 22:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:26,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:01:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:26,037 INFO L225 Difference]: With dead ends: 235 [2024-10-31 22:01:26,037 INFO L226 Difference]: Without dead ends: 118 [2024-10-31 22:01:26,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:26,038 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:26,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-31 22:01:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-31 22:01:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2024-10-31 22:01:26,046 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 160 transitions. Word has length 103 [2024-10-31 22:01:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:26,046 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 160 transitions. [2024-10-31 22:01:26,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2024-10-31 22:01:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:26,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:26,048 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:26,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:01:26,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:26,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1022456582, now seen corresponding path program 1 times [2024-10-31 22:01:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101440883] [2024-10-31 22:01:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101440883] [2024-10-31 22:01:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101440883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:26,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:26,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718706632] [2024-10-31 22:01:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:26,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:26,257 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:26,269 INFO L93 Difference]: Finished difference Result 209 states and 283 transitions. [2024-10-31 22:01:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:01:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:26,270 INFO L225 Difference]: With dead ends: 209 [2024-10-31 22:01:26,271 INFO L226 Difference]: Without dead ends: 94 [2024-10-31 22:01:26,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:26,272 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:26,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-31 22:01:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-31 22:01:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.271604938271605) internal successors, (103), 81 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2024-10-31 22:01:26,278 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 103 [2024-10-31 22:01:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:26,278 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2024-10-31 22:01:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2024-10-31 22:01:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:01:26,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:26,280 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:26,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:01:26,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash -53015636, now seen corresponding path program 1 times [2024-10-31 22:01:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755154023] [2024-10-31 22:01:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-31 22:01:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755154023] [2024-10-31 22:01:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755154023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596932178] [2024-10-31 22:01:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:26,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:26,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:01:26,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:01:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:27,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-31 22:01:27,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:27,331 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:01:27,604 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 35 treesize of output 23 [2024-10-31 22:01:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:01:27,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:27,998 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 23 [2024-10-31 22:01:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-31 22:01:28,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596932178] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:01:28,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:01:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2024-10-31 22:01:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460747043] [2024-10-31 22:01:28,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:01:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 22:01:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 22:01:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:01:28,094 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand has 14 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2024-10-31 22:01:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:28,474 INFO L93 Difference]: Finished difference Result 193 states and 254 transitions. [2024-10-31 22:01:28,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:01:28,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) Word has length 105 [2024-10-31 22:01:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:28,476 INFO L225 Difference]: With dead ends: 193 [2024-10-31 22:01:28,476 INFO L226 Difference]: Without dead ends: 102 [2024-10-31 22:01:28,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-10-31 22:01:28,478 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 243 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:28,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 480 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:01:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-31 22:01:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-10-31 22:01:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2024-10-31 22:01:28,489 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 105 [2024-10-31 22:01:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:28,490 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2024-10-31 22:01:28,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2024-10-31 22:01:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2024-10-31 22:01:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:01:28,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:28,492 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:28,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:01:28,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-31 22:01:28,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:28,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash -127895213, now seen corresponding path program 1 times [2024-10-31 22:01:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570681870] [2024-10-31 22:01:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:01:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:01:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:01:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:01:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:01:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:01:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:01:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:01:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:01:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:29,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:29,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570681870] [2024-10-31 22:01:29,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570681870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:29,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:29,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:01:29,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106718912] [2024-10-31 22:01:29,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:29,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:01:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:29,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:01:29,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:01:29,258 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:29,361 INFO L93 Difference]: Finished difference Result 193 states and 251 transitions. [2024-10-31 22:01:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:01:29,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-31 22:01:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:29,363 INFO L225 Difference]: With dead ends: 193 [2024-10-31 22:01:29,363 INFO L226 Difference]: Without dead ends: 98 [2024-10-31 22:01:29,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:01:29,365 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 115 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:29,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 437 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-31 22:01:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-31 22:01:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 84 states have internal predecessors, (104), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2024-10-31 22:01:29,376 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 105 [2024-10-31 22:01:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:29,377 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2024-10-31 22:01:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2024-10-31 22:01:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:01:29,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:29,379 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:29,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:01:29,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:29,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash 689753237, now seen corresponding path program 1 times [2024-10-31 22:01:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092247518] [2024-10-31 22:01:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:29,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:29,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:29,724 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:01:29,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:01:29,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:01:29,733 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:29,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:01:29,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:01:29 BoogieIcfgContainer [2024-10-31 22:01:29,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:01:29,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:01:29,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:01:29,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:01:29,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:19" (3/4) ... [2024-10-31 22:01:29,953 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:01:29,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:01:29,955 INFO L158 Benchmark]: Toolchain (without parser) took 12359.38ms. Allocated memory was 119.5MB in the beginning and 285.2MB in the end (delta: 165.7MB). Free memory was 88.5MB in the beginning and 199.9MB in the end (delta: -111.4MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-10-31 22:01:29,955 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 119.5MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:01:29,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.44ms. Allocated memory is still 119.5MB. Free memory was 88.1MB in the beginning and 72.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:01:29,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.21ms. Allocated memory is still 119.5MB. Free memory was 72.5MB in the beginning and 68.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:01:29,956 INFO L158 Benchmark]: Boogie Preprocessor took 127.91ms. Allocated memory is still 119.5MB. Free memory was 68.5MB in the beginning and 63.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:01:29,957 INFO L158 Benchmark]: RCFGBuilder took 1005.07ms. Allocated memory is still 119.5MB. Free memory was 63.3MB in the beginning and 63.4MB in the end (delta: -52.6kB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-10-31 22:01:29,957 INFO L158 Benchmark]: TraceAbstraction took 10764.06ms. Allocated memory was 119.5MB in the beginning and 285.2MB in the end (delta: 165.7MB). Free memory was 62.3MB in the beginning and 201.0MB in the end (delta: -138.6MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2024-10-31 22:01:29,957 INFO L158 Benchmark]: Witness Printer took 5.47ms. Allocated memory is still 285.2MB. Free memory was 201.0MB in the beginning and 199.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:01:29,959 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.19ms. Allocated memory is still 119.5MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.44ms. Allocated memory is still 119.5MB. Free memory was 88.1MB in the beginning and 72.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.21ms. Allocated memory is still 119.5MB. Free memory was 72.5MB in the beginning and 68.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.91ms. Allocated memory is still 119.5MB. Free memory was 68.5MB in the beginning and 63.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1005.07ms. Allocated memory is still 119.5MB. Free memory was 63.3MB in the beginning and 63.4MB in the end (delta: -52.6kB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10764.06ms. Allocated memory was 119.5MB in the beginning and 285.2MB in the end (delta: 165.7MB). Free memory was 62.3MB in the beginning and 201.0MB in the end (delta: -138.6MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. * Witness Printer took 5.47ms. Allocated memory is still 285.2MB. Free memory was 201.0MB in the beginning and 199.9MB 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 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -1; [L22] signed long int var_1_1 = -1; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_8 = 5; [L24] unsigned char var_1_8 = 5; [L25] unsigned char* var_1_8_Pointer = &(var_1_8); [L26] unsigned char var_1_9 = 4; [L26] unsigned char var_1_9 = 4; [L27] unsigned char* var_1_9_Pointer = &(var_1_9); [L28] float var_1_10 = 16.5; [L28] float var_1_10 = 16.5; [L29] float* var_1_10_Pointer = &(var_1_10); [L30] float var_1_11 = 127.25; [L30] float var_1_11 = 127.25; [L31] float* var_1_11_Pointer = &(var_1_11); [L32] unsigned char var_1_12 = 1; [L32] unsigned char var_1_12 = 1; [L33] unsigned char* var_1_12_Pointer = &(var_1_12); [L34] unsigned char var_1_13 = 0; [L34] unsigned char var_1_13 = 0; [L35] unsigned char* var_1_13_Pointer = &(var_1_13); [L36] unsigned char var_1_15 = 0; [L36] unsigned char var_1_15 = 0; [L37] unsigned char* var_1_15_Pointer = &(var_1_15); [L38] unsigned char var_1_16 = 0; [L38] unsigned char var_1_16 = 0; [L39] unsigned char* var_1_16_Pointer = &(var_1_16); [L40] unsigned char var_1_17 = 0; [L40] unsigned char var_1_17 = 0; [L41] unsigned char* var_1_17_Pointer = &(var_1_17); [L42] unsigned char var_1_18 = 0; [L42] unsigned char var_1_18 = 0; [L43] unsigned char* var_1_18_Pointer = &(var_1_18); VAL [isInitial=0, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L72] var_1_9 = __VERIFIER_nondet_uchar() [L73] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] var_1_11 = __VERIFIER_nondet_float() [L76] EXPR \read(var_1_11) [L76] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L76] EXPR \read(var_1_11) [L76] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] var_1_15 = __VERIFIER_nondet_uchar() [L81] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] var_1_16 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L86] var_1_18 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L87] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L87] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L101] RET updateVariables() [L102] CALL step() [L47] EXPR \read(*var_1_9_Pointer) [L47] (*(var_1_8_Pointer)) = ((*(var_1_9_Pointer)) + 100) [L48] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L48] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) [L48] EXPR \read(*var_1_11_Pointer) [L48] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L48] (*(var_1_10_Pointer)) = (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))) [L49] EXPR \read(*var_1_8_Pointer) [L49] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L49] COND FALSE !((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] (*(var_1_1_Pointer)) = ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))))) [L54] EXPR \read(*var_1_11_Pointer) [L54] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L54] COND TRUE (*(var_1_11_Pointer)) <= (*(var_1_10_Pointer)) [L55] EXPR \read(*var_1_1_Pointer) [L55] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L55] COND TRUE (*(var_1_1_Pointer)) != (*(var_1_8_Pointer)) [L56] EXPR \read(*var_1_18_Pointer) [L56] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L65] EXPR \read(*var_1_10_Pointer) [L65] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L65] COND FALSE !((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) [L68] EXPR \read(*var_1_1_Pointer) [L68] EXPR \read(*var_1_9_Pointer) [L68] EXPR ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L68] EXPR ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)) [L68] EXPR \read(*var_1_16_Pointer) [L68] EXPR ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L68] (*(var_1_12_Pointer)) = (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))) [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))))))) [L93] EXPR \read(*var_1_1_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100))) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_9_Pointer) [L93] EXPR (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))))) [L93] EXPR \read(*var_1_10_Pointer) [L93] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) [L93] EXPR \read(*var_1_11_Pointer) [L93] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93-L94] return ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0)))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 4300 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3034 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 1266 mSDtfsCounter, 660 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 121 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1347 NumberOfCodeBlocks, 1347 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1334 ConstructedInterpolants, 0 QuantifiedInterpolants, 3593 SizeOfPredicates, 17 NumberOfNonLiveVariables, 989 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2676/2860 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:01:30,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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_ca7c949e-b915-4431-8d73-016905a9153a/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 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:01:32,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:01:32,927 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:01:32,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:01:32,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:01:32,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:01:32,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:01:32,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:01:32,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:01:32,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:01:32,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:01:32,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:01:32,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:01:32,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:01:32,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:01:32,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:01:32,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:01:32,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:01:32,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:01:32,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:01:32,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:01:32,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:01:32,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:01:32,995 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:01:32,995 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:01:32,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:01:32,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:01:32,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:01:32,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:01:32,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:01:32,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:01:32,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:01:32,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:01:32,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:01:32,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:33,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:01:33,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:01:33,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:01:33,002 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:01:33,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:01:33,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:01:33,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:01:33,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:01:33,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:01:33,003 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:01:33,004 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_ca7c949e-b915-4431-8d73-016905a9153a/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_ca7c949e-b915-4431-8d73-016905a9153a/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 -> 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 [2024-10-31 22:01:33,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:01:33,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:01:33,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:01:33,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:01:33,497 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:01:33,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i Unable to find full path for "g++" [2024-10-31 22:01:35,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:01:36,104 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:01:36,105 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i [2024-10-31 22:01:36,119 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data/0fd824ecf/dc8af09d15f04009b95be34fea727b94/FLAG379317e84 [2024-10-31 22:01:36,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/data/0fd824ecf/dc8af09d15f04009b95be34fea727b94 [2024-10-31 22:01:36,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:01:36,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:01:36,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:36,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:01:36,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:01:36,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:36,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecf3b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36, skipping insertion in model container [2024-10-31 22:01:36,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:36,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:01:36,782 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i[916,929] [2024-10-31 22:01:36,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:36,872 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:01:36,891 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_ca7c949e-b915-4431-8d73-016905a9153a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i[916,929] [2024-10-31 22:01:36,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:36,955 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:01:36,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36 WrapperNode [2024-10-31 22:01:36,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:36,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:36,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:01:36,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:01:36,968 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:01:36" (1/1) ... [2024-10-31 22:01:36,988 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:01:36" (1/1) ... [2024-10-31 22:01:37,039 INFO L138 Inliner]: procedures = 33, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2024-10-31 22:01:37,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:37,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:01:37,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:01:37,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:01:37,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,132 INFO L175 MemorySlicer]: Split 115 memory accesses to 12 slices as follows [2, 9, 35, 8, 7, 14, 5, 6, 6, 8, 9, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1]. [2024-10-31 22:01:37,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:01:37,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:01:37,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:01:37,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:01:37,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (1/1) ... [2024-10-31 22:01:37,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:37,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:37,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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:01:37,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/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:01:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:01:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 22:01:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 22:01:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-31 22:01:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-31 22:01:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-31 22:01:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-31 22:01:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-31 22:01:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-31 22:01:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-31 22:01:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-31 22:01:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-31 22:01:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-31 22:01:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:01:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:01:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 22:01:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-31 22:01:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-31 22:01:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-31 22:01:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-31 22:01:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-31 22:01:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-31 22:01:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-31 22:01:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-31 22:01:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-31 22:01:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-31 22:01:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-31 22:01:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-31 22:01:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-31 22:01:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-31 22:01:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-31 22:01:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-31 22:01:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-31 22:01:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-31 22:01:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-31 22:01:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-31 22:01:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-31 22:01:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 22:01:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 22:01:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-31 22:01:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-31 22:01:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-31 22:01:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-31 22:01:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-31 22:01:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-31 22:01:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-31 22:01:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-31 22:01:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-31 22:01:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-31 22:01:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 22:01:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 22:01:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-31 22:01:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-31 22:01:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-31 22:01:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-31 22:01:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-31 22:01:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-31 22:01:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-31 22:01:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-31 22:01:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-31 22:01:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-31 22:01:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 22:01:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 22:01:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-31 22:01:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-31 22:01:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-31 22:01:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-31 22:01:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-31 22:01:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-31 22:01:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-31 22:01:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-31 22:01:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-31 22:01:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-31 22:01:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 22:01:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 22:01:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-31 22:01:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-31 22:01:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-31 22:01:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-31 22:01:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-31 22:01:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-31 22:01:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-31 22:01:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-31 22:01:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-31 22:01:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-31 22:01:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:01:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:01:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:01:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:01:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 22:01:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 22:01:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-31 22:01:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-31 22:01:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-31 22:01:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-31 22:01:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-31 22:01:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-31 22:01:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-31 22:01:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-31 22:01:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-31 22:01:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-31 22:01:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 22:01:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 22:01:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-31 22:01:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-31 22:01:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-31 22:01:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-31 22:01:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-31 22:01:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-31 22:01:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-31 22:01:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-31 22:01:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-31 22:01:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-31 22:01:37,616 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:01:37,619 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:01:38,353 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-31 22:01:38,353 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:01:38,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:01:38,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:01:38,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:38 BoogieIcfgContainer [2024-10-31 22:01:38,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:01:38,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:01:38,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:01:38,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:01:38,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:01:36" (1/3) ... [2024-10-31 22:01:38,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333cc169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:38, skipping insertion in model container [2024-10-31 22:01:38,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:36" (2/3) ... [2024-10-31 22:01:38,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333cc169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:38, skipping insertion in model container [2024-10-31 22:01:38,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:38" (3/3) ... [2024-10-31 22:01:38,379 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-42.i [2024-10-31 22:01:38,400 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:01:38,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:01:38,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:01:38,482 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;@50754e63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:01:38,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:01:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:38,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:38,501 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:38,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 990451809, now seen corresponding path program 1 times [2024-10-31 22:01:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:01:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083850927] [2024-10-31 22:01:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:38,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:01:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:01:38,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:01:38,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:01:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:39,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:01:39,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-31 22:01:39,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:01:39,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083850927] [2024-10-31 22:01:39,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083850927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:39,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:39,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364350960] [2024-10-31 22:01:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:39,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:01:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:01:39,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:01:39,133 INFO L87 Difference]: Start difference. First operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:39,188 INFO L93 Difference]: Finished difference Result 193 states and 293 transitions. [2024-10-31 22:01:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:01:39,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:01:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:39,203 INFO L225 Difference]: With dead ends: 193 [2024-10-31 22:01:39,203 INFO L226 Difference]: Without dead ends: 96 [2024-10-31 22:01:39,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:01:39,216 INFO L432 NwaCegarLoop]: 135 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, 135 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:01:39,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-31 22:01:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-31 22:01:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-31 22:01:39,288 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2024-10-31 22:01:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:39,288 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-31 22:01:39,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:01:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-31 22:01:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:39,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:39,294 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:39,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:01:39,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:01:39,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:39,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash -214908817, now seen corresponding path program 1 times [2024-10-31 22:01:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:01:39,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254237411] [2024-10-31 22:01:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:39,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:01:39,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:01:39,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:01:39,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:01:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:39,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:01:39,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-31 22:01:39,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:01:39,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:39,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254237411] [2024-10-31 22:01:39,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254237411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:39,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:39,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:39,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157586473] [2024-10-31 22:01:39,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:39,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:39,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:39,971 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:01:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:40,067 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2024-10-31 22:01:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-31 22:01:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:40,072 INFO L225 Difference]: With dead ends: 191 [2024-10-31 22:01:40,072 INFO L226 Difference]: Without dead ends: 98 [2024-10-31 22:01:40,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:40,076 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:40,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-31 22:01:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-31 22:01:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-10-31 22:01:40,092 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 103 [2024-10-31 22:01:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:40,094 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-10-31 22:01:40,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:01:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-10-31 22:01:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:40,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:40,101 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:40,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-31 22:01:40,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:01:40,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:40,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1743665969, now seen corresponding path program 1 times [2024-10-31 22:01:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:01:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125358228] [2024-10-31 22:01:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:40,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:01:40,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:01:40,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:01:40,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-31 22:01:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:40,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 22:01:40,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:41,374 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 33 treesize of output 21 [2024-10-31 22:01:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:01:41,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:41,768 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-31 22:01:41,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-31 22:01:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-31 22:01:41,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125358228] [2024-10-31 22:01:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125358228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:01:41,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 22:01:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-31 22:01:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385617709] [2024-10-31 22:01:41,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 22:01:41,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:01:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:01:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:01:41,922 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-31 22:01:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:42,548 INFO L93 Difference]: Finished difference Result 201 states and 278 transitions. [2024-10-31 22:01:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:01:42,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 103 [2024-10-31 22:01:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:42,551 INFO L225 Difference]: With dead ends: 201 [2024-10-31 22:01:42,551 INFO L226 Difference]: Without dead ends: 106 [2024-10-31 22:01:42,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-31 22:01:42,556 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 279 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:42,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 540 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:01:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-31 22:01:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-10-31 22:01:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:01:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2024-10-31 22:01:42,578 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 103 [2024-10-31 22:01:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:42,579 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2024-10-31 22:01:42,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-31 22:01:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2024-10-31 22:01:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:01:42,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:42,582 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:42,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-31 22:01:42,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:01:42,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:42,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -361437544, now seen corresponding path program 1 times [2024-10-31 22:01:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:01:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724957725] [2024-10-31 22:01:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:42,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:01:42,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:01:42,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:01:42,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7c949e-b915-4431-8d73-016905a9153a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-31 22:01:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:43,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-31 22:01:43,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:43,574 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 21 treesize of output 17 [2024-10-31 22:01:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:01:43,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:01:44,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724957725] [2024-10-31 22:01:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724957725] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:44,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 22:01:44,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-10-31 22:01:44,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436360538] [2024-10-31 22:01:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:44,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:01:44,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:44,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:01:44,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:01:44,064 INFO L87 Difference]: Start difference. First operand 102 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)