./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:43:37,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:43:37,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:43:37,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:43:37,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:43:37,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:43:37,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:43:37,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:43:37,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:43:37,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:43:37,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:43:37,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:43:37,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:43:37,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:43:37,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:43:37,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:43:37,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:43:37,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:43:37,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:43:37,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:43:37,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:43:37,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:43:37,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:43:37,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:43:37,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:43:37,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:43:37,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:43:37,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:43:37,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:43:37,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:43:37,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:43:37,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:43:37,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:43:37,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:43:37,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:43:37,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:43:37,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:43:37,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:43:37,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:43:37,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:43:37,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:43:37,285 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:43:37,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:43:37,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:43:37,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:43:37,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:43:37,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:43:37,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:43:37,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:43:37,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:43:37,312 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:43:37,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:43:37,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:43:37,312 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:43:37,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:43:37,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:43:37,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:43:37,313 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:43:37,313 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:43:37,313 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:43:37,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:43:37,314 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:43:37,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:43:37,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:43:37,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:43:37,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:43:37,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:43:37,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:43:37,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:43:37,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:43:37,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:43:37,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:43:37,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2022-11-20 11:43:37,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:43:37,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:43:37,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:43:37,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:43:37,579 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:43:37,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-20 11:43:40,627 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:43:40,901 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:43:40,902 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-20 11:43:40,920 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data/909947941/592a7241a7434577bda7d11dfbabc123/FLAG8dbdb7278 [2022-11-20 11:43:40,934 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data/909947941/592a7241a7434577bda7d11dfbabc123 [2022-11-20 11:43:40,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:43:40,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:43:40,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:43:40,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:43:40,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:43:40,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:43:40" (1/1) ... [2022-11-20 11:43:40,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2a5303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:40, skipping insertion in model container [2022-11-20 11:43:40,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:43:40" (1/1) ... [2022-11-20 11:43:40,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:43:41,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:43:41,175 WARN L237 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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-20 11:43:41,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:43:41,476 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:43:41,491 WARN L237 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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-20 11:43:41,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:43:41,619 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:43:41,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41 WrapperNode [2022-11-20 11:43:41,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:43:41,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:43:41,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:43:41,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:43:41,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,704 INFO L138 Inliner]: procedures = 175, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-11-20 11:43:41,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:43:41,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:43:41,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:43:41,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:43:41,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:43:41,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:43:41,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:43:41,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:43:41,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (1/1) ... [2022-11-20 11:43:41,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:43:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:43:41,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:43:41,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:43:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:43:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:43:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:43:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:43:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:43:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:43:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 11:43:41,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 11:43:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 11:43:41,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 11:43:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:43:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:43:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:43:41,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:43:41,843 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:43:42,068 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:43:42,070 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:43:42,573 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:43:43,337 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:43:43,338 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:43:43,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:43:43 BoogieIcfgContainer [2022-11-20 11:43:43,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:43:43,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:43:43,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:43:43,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:43:43,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:43:40" (1/3) ... [2022-11-20 11:43:43,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357bc219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:43:43, skipping insertion in model container [2022-11-20 11:43:43,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:41" (2/3) ... [2022-11-20 11:43:43,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357bc219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:43:43, skipping insertion in model container [2022-11-20 11:43:43,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:43:43" (3/3) ... [2022-11-20 11:43:43,353 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2022-11-20 11:43:43,374 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:43:43,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-20 11:43:43,375 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:43:43,495 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 11:43:43,539 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 11:43:43,561 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 146 transitions, 302 flow [2022-11-20 11:43:43,566 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 146 transitions, 302 flow [2022-11-20 11:43:43,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 146 transitions, 302 flow [2022-11-20 11:43:43,692 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-20 11:43:43,693 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:43:43,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 196 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-11-20 11:43:43,704 INFO L119 LiptonReduction]: Number of co-enabled transitions 3768 [2022-11-20 11:44:05,173 INFO L134 LiptonReduction]: Checked pairs total: 11419 [2022-11-20 11:44:05,174 INFO L136 LiptonReduction]: Total number of compositions: 143 [2022-11-20 11:44:05,182 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 54 transitions, 118 flow [2022-11-20 11:44:05,359 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:05,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:44:05,395 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@23c37980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:44:05,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-11-20 11:44:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 11:44:05,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:05,426 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 11:44:05,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:05,437 INFO L85 PathProgramCache]: Analyzing trace with hash 915, now seen corresponding path program 1 times [2022-11-20 11:44:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:05,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856579788] [2022-11-20 11:44:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:05,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:05,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:05,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856579788] [2022-11-20 11:44:05,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856579788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:05,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 11:44:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572136395] [2022-11-20 11:44:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:44:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:44:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:44:05,608 INFO L87 Difference]: Start difference. First operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:05,721 INFO L93 Difference]: Finished difference Result 770 states and 2021 transitions. [2022-11-20 11:44:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:44:05,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 11:44:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:05,741 INFO L225 Difference]: With dead ends: 770 [2022-11-20 11:44:05,741 INFO L226 Difference]: Without dead ends: 770 [2022-11-20 11:44:05,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:44:05,745 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 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 [2022-11-20 11:44:05,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-20 11:44:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-20 11:44:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 636 states have (on average 3.1776729559748427) internal successors, (2021), 769 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2021 transitions. [2022-11-20 11:44:05,825 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2021 transitions. Word has length 1 [2022-11-20 11:44:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:05,825 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2021 transitions. [2022-11-20 11:44:05,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2021 transitions. [2022-11-20 11:44:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:44:05,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:05,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:44:05,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:44:05,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 905030, now seen corresponding path program 1 times [2022-11-20 11:44:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:05,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507352073] [2022-11-20 11:44:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:06,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:06,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507352073] [2022-11-20 11:44:06,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507352073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:06,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:06,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:44:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219536375] [2022-11-20 11:44:06,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:06,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:44:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:44:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:06,158 INFO L87 Difference]: Start difference. First operand 770 states and 2021 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:06,285 INFO L93 Difference]: Finished difference Result 545 states and 1298 transitions. [2022-11-20 11:44:06,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:44:06,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 11:44:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:06,290 INFO L225 Difference]: With dead ends: 545 [2022-11-20 11:44:06,292 INFO L226 Difference]: Without dead ends: 539 [2022-11-20 11:44:06,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:06,295 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:06,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-20 11:44:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 479. [2022-11-20 11:44:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 430 states have (on average 2.7906976744186047) internal successors, (1200), 478 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1200 transitions. [2022-11-20 11:44:06,340 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1200 transitions. Word has length 3 [2022-11-20 11:44:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:06,341 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 1200 transitions. [2022-11-20 11:44:06,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1200 transitions. [2022-11-20 11:44:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:44:06,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:06,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:44:06,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:44:06,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 905031, now seen corresponding path program 1 times [2022-11-20 11:44:06,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:06,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095696947] [2022-11-20 11:44:06,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:06,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:06,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095696947] [2022-11-20 11:44:06,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095696947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:06,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:06,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:44:06,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653606627] [2022-11-20 11:44:06,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:06,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:44:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:44:06,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:06,486 INFO L87 Difference]: Start difference. First operand 479 states and 1200 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:06,561 INFO L93 Difference]: Finished difference Result 301 states and 711 transitions. [2022-11-20 11:44:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:44:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 11:44:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:06,563 INFO L225 Difference]: With dead ends: 301 [2022-11-20 11:44:06,564 INFO L226 Difference]: Without dead ends: 295 [2022-11-20 11:44:06,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:06,565 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:06,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-20 11:44:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-11-20 11:44:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 277 states have (on average 2.5415162454873648) internal successors, (704), 294 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 704 transitions. [2022-11-20 11:44:06,575 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 704 transitions. Word has length 3 [2022-11-20 11:44:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:06,576 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 704 transitions. [2022-11-20 11:44:06,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 704 transitions. [2022-11-20 11:44:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 11:44:06,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:06,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:06,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:44:06,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:06,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1633213867, now seen corresponding path program 1 times [2022-11-20 11:44:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:06,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338376330] [2022-11-20 11:44:06,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:06,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:06,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338376330] [2022-11-20 11:44:06,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338376330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:06,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:06,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:44:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938572579] [2022-11-20 11:44:06,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:06,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:44:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:44:06,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:06,773 INFO L87 Difference]: Start difference. First operand 295 states and 704 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:06,868 INFO L93 Difference]: Finished difference Result 285 states and 676 transitions. [2022-11-20 11:44:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:44:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 11:44:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:06,871 INFO L225 Difference]: With dead ends: 285 [2022-11-20 11:44:06,871 INFO L226 Difference]: Without dead ends: 285 [2022-11-20 11:44:06,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:06,872 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:06,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-20 11:44:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-20 11:44:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 267 states have (on average 2.5318352059925093) internal successors, (676), 284 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 676 transitions. [2022-11-20 11:44:06,883 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 676 transitions. Word has length 7 [2022-11-20 11:44:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:06,885 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 676 transitions. [2022-11-20 11:44:06,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 676 transitions. [2022-11-20 11:44:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 11:44:06,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:06,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:06,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:44:06,887 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -524093055, now seen corresponding path program 1 times [2022-11-20 11:44:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:06,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879743724] [2022-11-20 11:44:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:07,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879743724] [2022-11-20 11:44:07,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879743724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:07,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:07,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:44:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641144466] [2022-11-20 11:44:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:07,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:44:07,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:44:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:07,471 INFO L87 Difference]: Start difference. First operand 285 states and 676 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:07,602 INFO L93 Difference]: Finished difference Result 255 states and 602 transitions. [2022-11-20 11:44:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:44:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 11:44:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:07,605 INFO L225 Difference]: With dead ends: 255 [2022-11-20 11:44:07,605 INFO L226 Difference]: Without dead ends: 255 [2022-11-20 11:44:07,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:07,606 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:07,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-20 11:44:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-20 11:44:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 239 states have (on average 2.518828451882845) internal successors, (602), 254 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 602 transitions. [2022-11-20 11:44:07,617 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 602 transitions. Word has length 8 [2022-11-20 11:44:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:07,617 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 602 transitions. [2022-11-20 11:44:07,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 602 transitions. [2022-11-20 11:44:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 11:44:07,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:07,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:07,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:44:07,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 909975219, now seen corresponding path program 1 times [2022-11-20 11:44:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:07,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471454913] [2022-11-20 11:44:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:07,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471454913] [2022-11-20 11:44:07,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471454913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:07,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:07,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:44:07,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592154680] [2022-11-20 11:44:07,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:07,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:44:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:44:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:07,864 INFO L87 Difference]: Start difference. First operand 255 states and 602 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:07,932 INFO L93 Difference]: Finished difference Result 251 states and 591 transitions. [2022-11-20 11:44:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:44:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 11:44:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:07,935 INFO L225 Difference]: With dead ends: 251 [2022-11-20 11:44:07,935 INFO L226 Difference]: Without dead ends: 251 [2022-11-20 11:44:07,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:07,936 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:07,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-20 11:44:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-20 11:44:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 235 states have (on average 2.5148936170212766) internal successors, (591), 250 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 591 transitions. [2022-11-20 11:44:07,982 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 591 transitions. Word has length 8 [2022-11-20 11:44:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:07,983 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 591 transitions. [2022-11-20 11:44:07,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 591 transitions. [2022-11-20 11:44:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:44:07,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:07,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:07,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:44:07,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1857200332, now seen corresponding path program 1 times [2022-11-20 11:44:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:07,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205682283] [2022-11-20 11:44:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:08,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205682283] [2022-11-20 11:44:08,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205682283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:08,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:08,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:44:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052502694] [2022-11-20 11:44:08,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:08,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:44:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:44:08,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:08,261 INFO L87 Difference]: Start difference. First operand 251 states and 591 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:08,376 INFO L93 Difference]: Finished difference Result 247 states and 580 transitions. [2022-11-20 11:44:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:44:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 11:44:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:08,378 INFO L225 Difference]: With dead ends: 247 [2022-11-20 11:44:08,378 INFO L226 Difference]: Without dead ends: 247 [2022-11-20 11:44:08,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:44:08,379 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:08,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 14 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-20 11:44:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-11-20 11:44:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 231 states have (on average 2.5108225108225106) internal successors, (580), 246 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 580 transitions. [2022-11-20 11:44:08,388 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 580 transitions. Word has length 9 [2022-11-20 11:44:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:08,388 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 580 transitions. [2022-11-20 11:44:08,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 580 transitions. [2022-11-20 11:44:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:44:08,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:08,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:08,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:44:08,390 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1143989408, now seen corresponding path program 1 times [2022-11-20 11:44:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:08,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554042389] [2022-11-20 11:44:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554042389] [2022-11-20 11:44:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554042389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:08,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:08,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:44:08,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312444445] [2022-11-20 11:44:08,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:44:08,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:08,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:44:08,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:44:08,615 INFO L87 Difference]: Start difference. First operand 247 states and 580 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:08,723 INFO L93 Difference]: Finished difference Result 321 states and 734 transitions. [2022-11-20 11:44:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:44:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 11:44:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:08,725 INFO L225 Difference]: With dead ends: 321 [2022-11-20 11:44:08,725 INFO L226 Difference]: Without dead ends: 321 [2022-11-20 11:44:08,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:08,726 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 45 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:08,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 11 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-20 11:44:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 267. [2022-11-20 11:44:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 251 states have (on average 2.4820717131474104) internal successors, (623), 266 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 623 transitions. [2022-11-20 11:44:08,735 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 623 transitions. Word has length 10 [2022-11-20 11:44:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:08,735 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 623 transitions. [2022-11-20 11:44:08,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 623 transitions. [2022-11-20 11:44:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:44:08,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:08,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:08,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:44:08,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1687120806, now seen corresponding path program 1 times [2022-11-20 11:44:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175843989] [2022-11-20 11:44:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:08,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175843989] [2022-11-20 11:44:08,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175843989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:08,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:08,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:44:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874755297] [2022-11-20 11:44:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:08,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:44:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:44:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:08,926 INFO L87 Difference]: Start difference. First operand 267 states and 623 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:09,040 INFO L93 Difference]: Finished difference Result 274 states and 565 transitions. [2022-11-20 11:44:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:44:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 11:44:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:09,043 INFO L225 Difference]: With dead ends: 274 [2022-11-20 11:44:09,043 INFO L226 Difference]: Without dead ends: 274 [2022-11-20 11:44:09,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:09,044 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:09,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-20 11:44:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2022-11-20 11:44:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 218 states have (on average 2.293577981651376) internal successors, (500), 233 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 500 transitions. [2022-11-20 11:44:09,052 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 500 transitions. Word has length 10 [2022-11-20 11:44:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:09,053 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 500 transitions. [2022-11-20 11:44:09,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 500 transitions. [2022-11-20 11:44:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:44:09,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:09,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:09,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:44:09,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:09,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1687120774, now seen corresponding path program 1 times [2022-11-20 11:44:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801327489] [2022-11-20 11:44:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:09,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801327489] [2022-11-20 11:44:09,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801327489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:09,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:09,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:44:09,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632344477] [2022-11-20 11:44:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:09,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:44:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:44:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:09,270 INFO L87 Difference]: Start difference. First operand 234 states and 500 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:09,409 INFO L93 Difference]: Finished difference Result 181 states and 392 transitions. [2022-11-20 11:44:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:44:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 11:44:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:09,410 INFO L225 Difference]: With dead ends: 181 [2022-11-20 11:44:09,410 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 11:44:09,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:09,411 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:09,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 11:44:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-20 11:44:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 143 states have (on average 2.125874125874126) internal successors, (304), 150 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 304 transitions. [2022-11-20 11:44:09,417 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 304 transitions. Word has length 10 [2022-11-20 11:44:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:09,417 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 304 transitions. [2022-11-20 11:44:09,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 304 transitions. [2022-11-20 11:44:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:44:09,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:09,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:09,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:44:09,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash 429347638, now seen corresponding path program 1 times [2022-11-20 11:44:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:09,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778642888] [2022-11-20 11:44:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:11,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778642888] [2022-11-20 11:44:11,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778642888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:11,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:11,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:44:11,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999422490] [2022-11-20 11:44:11,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:11,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:44:11,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:11,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:44:11,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:44:11,009 INFO L87 Difference]: Start difference. First operand 151 states and 304 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:11,296 INFO L93 Difference]: Finished difference Result 202 states and 421 transitions. [2022-11-20 11:44:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:44:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:44:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:11,297 INFO L225 Difference]: With dead ends: 202 [2022-11-20 11:44:11,297 INFO L226 Difference]: Without dead ends: 202 [2022-11-20 11:44:11,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:44:11,298 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:11,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 11 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:44:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-20 11:44:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2022-11-20 11:44:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 164 states have (on average 2.152439024390244) internal successors, (353), 171 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 353 transitions. [2022-11-20 11:44:11,303 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 353 transitions. Word has length 11 [2022-11-20 11:44:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:11,304 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 353 transitions. [2022-11-20 11:44:11,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 353 transitions. [2022-11-20 11:44:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:44:11,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:11,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:11,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:44:11,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1797100854, now seen corresponding path program 2 times [2022-11-20 11:44:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:11,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139061857] [2022-11-20 11:44:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:11,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:12,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:12,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139061857] [2022-11-20 11:44:12,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139061857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:12,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:12,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:44:12,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262226307] [2022-11-20 11:44:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:12,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:44:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:44:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:44:12,560 INFO L87 Difference]: Start difference. First operand 172 states and 353 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:13,146 INFO L93 Difference]: Finished difference Result 170 states and 348 transitions. [2022-11-20 11:44:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:44:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:44:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:13,148 INFO L225 Difference]: With dead ends: 170 [2022-11-20 11:44:13,148 INFO L226 Difference]: Without dead ends: 170 [2022-11-20 11:44:13,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:44:13,149 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:13,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 7 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:44:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-20 11:44:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 149. [2022-11-20 11:44:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 141 states have (on average 2.120567375886525) internal successors, (299), 148 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 299 transitions. [2022-11-20 11:44:13,154 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 299 transitions. Word has length 11 [2022-11-20 11:44:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:13,159 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 299 transitions. [2022-11-20 11:44:13,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 299 transitions. [2022-11-20 11:44:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:44:13,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:13,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:13,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:44:13,160 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -761134163, now seen corresponding path program 1 times [2022-11-20 11:44:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:13,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787656079] [2022-11-20 11:44:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:13,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787656079] [2022-11-20 11:44:13,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787656079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:13,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:13,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:44:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141534313] [2022-11-20 11:44:13,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:13,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:44:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:13,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:44:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:44:13,252 INFO L87 Difference]: Start difference. First operand 149 states and 299 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:13,328 INFO L93 Difference]: Finished difference Result 140 states and 289 transitions. [2022-11-20 11:44:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:44:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:44:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:13,330 INFO L225 Difference]: With dead ends: 140 [2022-11-20 11:44:13,330 INFO L226 Difference]: Without dead ends: 56 [2022-11-20 11:44:13,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:44:13,331 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:13,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:44:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-20 11:44:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-20 11:44:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 105 transitions. [2022-11-20 11:44:13,333 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 105 transitions. Word has length 11 [2022-11-20 11:44:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:13,334 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 105 transitions. [2022-11-20 11:44:13,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 105 transitions. [2022-11-20 11:44:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:44:13,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:13,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:13,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:44:13,335 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 421098680, now seen corresponding path program 1 times [2022-11-20 11:44:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:13,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967250618] [2022-11-20 11:44:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:13,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:13,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967250618] [2022-11-20 11:44:13,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967250618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:13,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:13,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:44:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121431850] [2022-11-20 11:44:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:13,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:44:13,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:13,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:44:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:13,604 INFO L87 Difference]: Start difference. First operand 56 states and 105 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:13,640 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. [2022-11-20 11:44:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:44:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:44:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:13,641 INFO L225 Difference]: With dead ends: 42 [2022-11-20 11:44:13,641 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 11:44:13,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:44:13,642 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:13,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:44:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 11:44:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-20 11:44:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2022-11-20 11:44:13,645 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 12 [2022-11-20 11:44:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:13,645 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2022-11-20 11:44:13,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2022-11-20 11:44:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:44:13,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:13,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:13,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:44:13,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1594762637, now seen corresponding path program 1 times [2022-11-20 11:44:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:13,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370742137] [2022-11-20 11:44:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:13,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:13,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370742137] [2022-11-20 11:44:13,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370742137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:44:13,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:44:13,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:44:13,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598869829] [2022-11-20 11:44:13,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:44:13,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:44:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:13,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:44:13,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:44:13,892 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:13,940 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2022-11-20 11:44:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:44:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:44:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:13,941 INFO L225 Difference]: With dead ends: 29 [2022-11-20 11:44:13,941 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 11:44:13,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:44:13,944 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:13,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:44:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 11:44:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-20 11:44:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-11-20 11:44:13,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 13 [2022-11-20 11:44:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:13,946 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-11-20 11:44:13,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-11-20 11:44:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:44:13,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:13,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:13,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:44:13,948 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:44:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 625035542, now seen corresponding path program 1 times [2022-11-20 11:44:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:13,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049465370] [2022-11-20 11:44:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:44:14,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:44:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:44:14,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:44:14,244 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:44:14,246 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (57 of 58 remaining) [2022-11-20 11:44:14,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2022-11-20 11:44:14,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2022-11-20 11:44:14,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2022-11-20 11:44:14,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2022-11-20 11:44:14,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2022-11-20 11:44:14,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2022-11-20 11:44:14,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2022-11-20 11:44:14,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2022-11-20 11:44:14,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2022-11-20 11:44:14,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2022-11-20 11:44:14,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2022-11-20 11:44:14,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2022-11-20 11:44:14,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2022-11-20 11:44:14,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2022-11-20 11:44:14,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2022-11-20 11:44:14,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2022-11-20 11:44:14,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 58 remaining) [2022-11-20 11:44:14,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2022-11-20 11:44:14,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2022-11-20 11:44:14,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2022-11-20 11:44:14,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2022-11-20 11:44:14,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2022-11-20 11:44:14,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2022-11-20 11:44:14,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2022-11-20 11:44:14,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2022-11-20 11:44:14,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2022-11-20 11:44:14,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2022-11-20 11:44:14,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2022-11-20 11:44:14,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2022-11-20 11:44:14,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2022-11-20 11:44:14,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2022-11-20 11:44:14,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2022-11-20 11:44:14,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (24 of 58 remaining) [2022-11-20 11:44:14,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2022-11-20 11:44:14,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2022-11-20 11:44:14,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 58 remaining) [2022-11-20 11:44:14,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2022-11-20 11:44:14,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2022-11-20 11:44:14,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2022-11-20 11:44:14,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2022-11-20 11:44:14,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2022-11-20 11:44:14,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2022-11-20 11:44:14,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2022-11-20 11:44:14,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2022-11-20 11:44:14,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2022-11-20 11:44:14,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2022-11-20 11:44:14,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2022-11-20 11:44:14,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2022-11-20 11:44:14,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2022-11-20 11:44:14,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2022-11-20 11:44:14,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2022-11-20 11:44:14,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2022-11-20 11:44:14,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 58 remaining) [2022-11-20 11:44:14,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2022-11-20 11:44:14,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2022-11-20 11:44:14,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2022-11-20 11:44:14,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2022-11-20 11:44:14,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:44:14,265 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:14,274 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:44:14,274 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:44:14,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:44:14 BasicIcfg [2022-11-20 11:44:14,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:44:14,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:44:14,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:44:14,372 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:44:14,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:43:43" (3/4) ... [2022-11-20 11:44:14,376 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:44:14,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:44:14,377 INFO L158 Benchmark]: Toolchain (without parser) took 33438.98ms. Allocated memory was 138.4MB in the beginning and 373.3MB in the end (delta: 234.9MB). Free memory was 90.3MB in the beginning and 285.6MB in the end (delta: -195.3MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2022-11-20 11:44:14,377 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 111.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:44:14,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.86ms. Allocated memory is still 138.4MB. Free memory was 90.3MB in the beginning and 66.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 11:44:14,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.46ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:44:14,379 INFO L158 Benchmark]: Boogie Preprocessor took 48.98ms. Allocated memory is still 138.4MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:44:14,379 INFO L158 Benchmark]: RCFGBuilder took 1585.24ms. Allocated memory is still 138.4MB. Free memory was 62.7MB in the beginning and 85.6MB in the end (delta: -23.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-11-20 11:44:14,379 INFO L158 Benchmark]: TraceAbstraction took 31026.30ms. Allocated memory was 138.4MB in the beginning and 373.3MB in the end (delta: 234.9MB). Free memory was 84.7MB in the beginning and 285.6MB in the end (delta: -200.9MB). Peak memory consumption was 215.2MB. Max. memory is 16.1GB. [2022-11-20 11:44:14,380 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 373.3MB. Free memory is still 285.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:44:14,381 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 111.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.86ms. Allocated memory is still 138.4MB. Free memory was 90.3MB in the beginning and 66.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.46ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.98ms. Allocated memory is still 138.4MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1585.24ms. Allocated memory is still 138.4MB. Free memory was 62.7MB in the beginning and 85.6MB in the end (delta: -23.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 31026.30ms. Allocated memory was 138.4MB in the beginning and 373.3MB in the end (delta: 234.9MB). Free memory was 84.7MB in the beginning and 285.6MB in the end (delta: -200.9MB). Peak memory consumption was 215.2MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 373.3MB. Free memory is still 285.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.6s, 151 PlacesBefore, 60 PlacesAfterwards, 146 TransitionsBefore, 54 TransitionsAfterwards, 3768 CoEnabledTransitionPairs, 7 FixpointIterations, 64 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 143 TotalNumberOfCompositions, 11419 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6938, independent: 6702, independent conditional: 0, independent unconditional: 6702, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 47, unknown conditional: 0, unknown unconditional: 47] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2662, independent: 2608, independent conditional: 0, independent unconditional: 2608, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2662, independent: 2355, independent conditional: 0, independent unconditional: 2355, dependent: 307, dependent conditional: 0, dependent unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 307, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2410, independent: 1723, independent conditional: 0, independent unconditional: 1723, dependent: 450, dependent conditional: 0, dependent unconditional: 450, unknown: 237, unknown conditional: 0, unknown unconditional: 237] ], Cache Queries: [ total: 6938, independent: 4094, independent conditional: 0, independent unconditional: 4094, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 2702, unknown conditional: 0, unknown unconditional: 2702] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 400, Positive conditional cache size: 0, Positive unconditional cache size: 400, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5 - 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1921, ((void *)0), P0, ((void *)0))=7, t1921={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1922, ((void *)0), P1, ((void *)0))=8, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 184 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 786 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 46 mSDtfsCounter, 786 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3178occurred in iteration=0, InterpolantAutomatonStates: 62, 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, 15 MinimizatonAttempts, 205 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1410 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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 [2022-11-20 11:44:14,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:44:16,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:44:16,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:44:17,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:44:17,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:44:17,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:44:17,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:44:17,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:44:17,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:44:17,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:44:17,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:44:17,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:44:17,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:44:17,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:44:17,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:44:17,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:44:17,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:44:17,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:44:17,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:44:17,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:44:17,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:44:17,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:44:17,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:44:17,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:44:17,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:44:17,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:44:17,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:44:17,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:44:17,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:44:17,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:44:17,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:44:17,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:44:17,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:44:17,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:44:17,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:44:17,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:44:17,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:44:17,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:44:17,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:44:17,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:44:17,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:44:17,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 11:44:17,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:44:17,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:44:17,162 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:44:17,162 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:44:17,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:44:17,164 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:44:17,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:44:17,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:44:17,165 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:44:17,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:44:17,167 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:44:17,167 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:44:17,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:44:17,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:44:17,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:44:17,168 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:44:17,168 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:44:17,168 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:44:17,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:44:17,169 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:44:17,169 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:44:17,169 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:44:17,169 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:44:17,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:44:17,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:44:17,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:44:17,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:44:17,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:44:17,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:44:17,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:44:17,171 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:44:17,172 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:44:17,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:44:17,172 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2022-11-20 11:44:17,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:44:17,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:44:17,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:44:17,695 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:44:17,696 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:44:17,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-20 11:44:20,963 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:44:21,223 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:44:21,223 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-20 11:44:21,238 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data/26e53c77c/023ceccd223146e581e140f5ea6b87d4/FLAGad95ef118 [2022-11-20 11:44:21,254 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/data/26e53c77c/023ceccd223146e581e140f5ea6b87d4 [2022-11-20 11:44:21,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:44:21,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:44:21,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:44:21,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:44:21,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:44:21,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:44:21" (1/1) ... [2022-11-20 11:44:21,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151b2ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:21, skipping insertion in model container [2022-11-20 11:44:21,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:44:21" (1/1) ... [2022-11-20 11:44:21,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:44:21,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:44:21,574 WARN L237 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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-20 11:44:21,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:44:21,892 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:44:21,906 WARN L237 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_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-20 11:44:21,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:44:22,047 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:44:22,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22 WrapperNode [2022-11-20 11:44:22,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:44:22,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:44:22,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:44:22,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:44:22,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,130 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2022-11-20 11:44:22,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:44:22,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:44:22,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:44:22,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:44:22,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,171 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:44:22,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:44:22,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:44:22,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:44:22,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (1/1) ... [2022-11-20 11:44:22,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:44:22,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:44:22,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:44:22,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:44:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 11:44:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:44:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:44:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:44:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:44:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 11:44:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:44:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 11:44:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 11:44:22,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 11:44:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 11:44:22,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 11:44:22,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:44:22,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:44:22,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:44:22,269 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:44:22,521 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:44:22,523 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:44:23,057 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:44:23,975 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:44:23,975 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:44:23,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:44:23 BoogieIcfgContainer [2022-11-20 11:44:23,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:44:23,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:44:23,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:44:23,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:44:23,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:44:21" (1/3) ... [2022-11-20 11:44:23,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6ba046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:44:23, skipping insertion in model container [2022-11-20 11:44:23,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:44:22" (2/3) ... [2022-11-20 11:44:23,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6ba046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:44:23, skipping insertion in model container [2022-11-20 11:44:23,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:44:23" (3/3) ... [2022-11-20 11:44:23,992 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2022-11-20 11:44:24,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:44:24,013 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-20 11:44:24,014 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:44:24,181 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 11:44:24,223 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 11:44:24,243 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 147 transitions, 304 flow [2022-11-20 11:44:24,247 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 147 transitions, 304 flow [2022-11-20 11:44:24,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 147 transitions, 304 flow [2022-11-20 11:44:24,352 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-20 11:44:24,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:44:24,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 196 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-11-20 11:44:24,364 INFO L119 LiptonReduction]: Number of co-enabled transitions 3768 [2022-11-20 11:44:49,072 WARN L233 SmtUtils]: Spent 9.78s on a formula simplification. DAG size of input: 262 DAG size of output: 261 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 11:45:33,267 INFO L134 LiptonReduction]: Checked pairs total: 11777 [2022-11-20 11:45:33,267 INFO L136 LiptonReduction]: Total number of compositions: 147 [2022-11-20 11:45:33,276 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 54 transitions, 118 flow [2022-11-20 11:45:33,434 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:33,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:45:33,461 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4d64cb8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:45:33,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-11-20 11:45:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 11:45:33,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:33,478 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 11:45:33,479 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:45:33,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 922, now seen corresponding path program 1 times [2022-11-20 11:45:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:33,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405039847] [2022-11-20 11:45:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:33,502 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 [2022-11-20 11:45:33,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:33,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:45:33,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:33,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 11:45:33,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:33,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:45:33,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:45:33,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405039847] [2022-11-20 11:45:33,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405039847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:45:33,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:45:33,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 11:45:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918511679] [2022-11-20 11:45:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:45:33,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:45:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:45:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:45:33,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:45:33,827 INFO L87 Difference]: Start difference. First operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:34,153 INFO L93 Difference]: Finished difference Result 770 states and 2021 transitions. [2022-11-20 11:45:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:45:34,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 11:45:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:34,175 INFO L225 Difference]: With dead ends: 770 [2022-11-20 11:45:34,176 INFO L226 Difference]: Without dead ends: 770 [2022-11-20 11:45:34,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:45:34,181 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:34,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:45:34,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-20 11:45:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-20 11:45:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 636 states have (on average 3.1776729559748427) internal successors, (2021), 769 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2021 transitions. [2022-11-20 11:45:34,272 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2021 transitions. Word has length 1 [2022-11-20 11:45:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:34,273 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2021 transitions. [2022-11-20 11:45:34,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2021 transitions. [2022-11-20 11:45:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:45:34,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:34,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:45:34,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:34,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:34,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:45:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash 910860, now seen corresponding path program 1 times [2022-11-20 11:45:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:34,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062782827] [2022-11-20 11:45:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:34,491 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 [2022-11-20 11:45:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:34,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:45:34,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:34,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:45:34,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:34,910 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:45:34,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:45:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:34,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:45:34,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:45:34,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062782827] [2022-11-20 11:45:34,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062782827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:45:34,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:45:34,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:45:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173287785] [2022-11-20 11:45:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:45:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:45:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:45:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:45:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:45:34,982 INFO L87 Difference]: Start difference. First operand 770 states and 2021 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:35,265 INFO L93 Difference]: Finished difference Result 443 states and 1109 transitions. [2022-11-20 11:45:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:45:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 11:45:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:35,270 INFO L225 Difference]: With dead ends: 443 [2022-11-20 11:45:35,270 INFO L226 Difference]: Without dead ends: 443 [2022-11-20 11:45:35,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:45:35,272 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:35,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:45:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-20 11:45:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-11-20 11:45:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 394 states have (on average 2.814720812182741) internal successors, (1109), 442 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1109 transitions. [2022-11-20 11:45:35,292 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1109 transitions. Word has length 3 [2022-11-20 11:45:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:35,293 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 1109 transitions. [2022-11-20 11:45:35,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1109 transitions. [2022-11-20 11:45:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:45:35,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:35,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:45:35,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:35,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:35,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:45:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 910861, now seen corresponding path program 1 times [2022-11-20 11:45:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034688340] [2022-11-20 11:45:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:35,513 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 [2022-11-20 11:45:35,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:35,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:45:35,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:35,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:45:35,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:35,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:45:35,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:45:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:35,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:45:35,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:45:35,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034688340] [2022-11-20 11:45:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034688340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:45:35,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:45:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:45:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716482084] [2022-11-20 11:45:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:45:35,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:45:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:45:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:45:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:45:35,877 INFO L87 Difference]: Start difference. First operand 443 states and 1109 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:36,028 INFO L93 Difference]: Finished difference Result 268 states and 643 transitions. [2022-11-20 11:45:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:45:36,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 11:45:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:36,031 INFO L225 Difference]: With dead ends: 268 [2022-11-20 11:45:36,031 INFO L226 Difference]: Without dead ends: 268 [2022-11-20 11:45:36,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:45:36,033 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:36,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:45:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-20 11:45:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-11-20 11:45:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 250 states have (on average 2.572) internal successors, (643), 267 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 643 transitions. [2022-11-20 11:45:36,043 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 643 transitions. Word has length 3 [2022-11-20 11:45:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:36,044 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 643 transitions. [2022-11-20 11:45:36,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 643 transitions. [2022-11-20 11:45:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 11:45:36,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:36,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:36,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:36,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:36,259 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:45:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash -550486824, now seen corresponding path program 1 times [2022-11-20 11:45:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:36,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706508724] [2022-11-20 11:45:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:36,260 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 [2022-11-20 11:45:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:36,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:45:36,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:36,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 11:45:36,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:36,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:45:36,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:45:36,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706508724] [2022-11-20 11:45:36,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706508724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:45:36,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:45:36,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:45:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592364372] [2022-11-20 11:45:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:45:36,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:45:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:45:36,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:45:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:45:36,524 INFO L87 Difference]: Start difference. First operand 268 states and 643 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:36,736 INFO L93 Difference]: Finished difference Result 258 states and 615 transitions. [2022-11-20 11:45:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:45:36,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 11:45:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:36,739 INFO L225 Difference]: With dead ends: 258 [2022-11-20 11:45:36,739 INFO L226 Difference]: Without dead ends: 258 [2022-11-20 11:45:36,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:45:36,741 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:36,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:45:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-20 11:45:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-20 11:45:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 240 states have (on average 2.5625) internal successors, (615), 257 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 615 transitions. [2022-11-20 11:45:36,766 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 615 transitions. Word has length 7 [2022-11-20 11:45:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:36,766 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 615 transitions. [2022-11-20 11:45:36,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 615 transitions. [2022-11-20 11:45:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 11:45:36,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:36,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:36,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:36,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:45:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1124453318, now seen corresponding path program 1 times [2022-11-20 11:45:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:36,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716303235] [2022-11-20 11:45:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:36,988 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 [2022-11-20 11:45:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:36,990 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:45:36,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (6)] Waiting until timeout for monitored process [2022-11-20 11:45:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:37,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:45:37,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:37,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:45:37,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:45:37,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716303235] [2022-11-20 11:45:37,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716303235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:45:37,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:45:37,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:45:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248614499] [2022-11-20 11:45:37,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:45:37,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:45:37,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:45:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:45:37,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:45:37,363 INFO L87 Difference]: Start difference. First operand 258 states and 615 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:37,730 INFO L93 Difference]: Finished difference Result 132 states and 239 transitions. [2022-11-20 11:45:37,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:45:37,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 11:45:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:37,732 INFO L225 Difference]: With dead ends: 132 [2022-11-20 11:45:37,732 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 11:45:37,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:45:37,734 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:37,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:45:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 11:45:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-20 11:45:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.96) internal successors, (196), 111 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 196 transitions. [2022-11-20 11:45:37,752 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 196 transitions. Word has length 8 [2022-11-20 11:45:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:37,753 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 196 transitions. [2022-11-20 11:45:37,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 196 transitions. [2022-11-20 11:45:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:45:37,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:37,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:37,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (6)] Ended with exit code 0 [2022-11-20 11:45:37,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:37,970 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:45:37,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash -770027440, now seen corresponding path program 1 times [2022-11-20 11:45:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:37,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050296881] [2022-11-20 11:45:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:37,972 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 [2022-11-20 11:45:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:37,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:45:38,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (7)] Waiting until timeout for monitored process [2022-11-20 11:45:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:38,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:45:38,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:38,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:45:38,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:45:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050296881] [2022-11-20 11:45:38,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050296881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:45:38,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:45:38,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:45:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410971739] [2022-11-20 11:45:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:45:38,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:45:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:45:38,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:45:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:45:38,367 INFO L87 Difference]: Start difference. First operand 112 states and 196 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:38,743 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-11-20 11:45:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:45:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 11:45:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:38,744 INFO L225 Difference]: With dead ends: 50 [2022-11-20 11:45:38,744 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 11:45:38,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:45:38,746 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:38,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 22 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:45:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 11:45:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-20 11:45:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.631578947368421) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2022-11-20 11:45:38,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 10 [2022-11-20 11:45:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:38,750 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2022-11-20 11:45:38,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2022-11-20 11:45:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:45:38,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:38,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:38,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (7)] Ended with exit code 0 [2022-11-20 11:45:38,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:45:38,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:45:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1623386890, now seen corresponding path program 1 times [2022-11-20 11:45:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:38,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686123330] [2022-11-20 11:45:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:38,957 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 [2022-11-20 11:45:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:38,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:45:38,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (8)] Waiting until timeout for monitored process [2022-11-20 11:45:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:39,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:45:39,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:46:29,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2022-11-20 11:46:29,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2022-11-20 11:46:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:46:29,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:46:29,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:46:29,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686123330] [2022-11-20 11:46:29,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686123330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:29,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:29,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:46:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877367542] [2022-11-20 11:46:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:29,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:46:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:46:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:46:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:46:29,606 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:46:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:29,807 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2022-11-20 11:46:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:46:29,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:46:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:29,809 INFO L225 Difference]: With dead ends: 41 [2022-11-20 11:46:29,809 INFO L226 Difference]: Without dead ends: 41 [2022-11-20 11:46:29,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:46:29,811 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:29,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:46:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-20 11:46:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-20 11:46:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.605263157894737) internal successors, (61), 40 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:46:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2022-11-20 11:46:29,819 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 14 [2022-11-20 11:46:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:29,820 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2022-11-20 11:46:29,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:46:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2022-11-20 11:46:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:46:29,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:29,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:46:29,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:46:30,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:46:30,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:46:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1623386889, now seen corresponding path program 1 times [2022-11-20 11:46:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:46:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561678916] [2022-11-20 11:46:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:30,025 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 [2022-11-20 11:46:30,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:46:30,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:46:30,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (9)] Waiting until timeout for monitored process [2022-11-20 11:46:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:46:30,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:46:35,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2022-11-20 11:46:35,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2022-11-20 11:46:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:46:35,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:46:35,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:46:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561678916] [2022-11-20 11:46:35,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561678916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:35,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:35,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:46:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193608138] [2022-11-20 11:46:35,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:35,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:46:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:46:35,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:46:35,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:46:35,246 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:46:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:35,481 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2022-11-20 11:46:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:46:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:35,483 INFO L225 Difference]: With dead ends: 40 [2022-11-20 11:46:35,483 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:46:35,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:46:35,484 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:35,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:46:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:46:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-20 11:46:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:46:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-11-20 11:46:35,488 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 14 [2022-11-20 11:46:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:35,488 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-11-20 11:46:35,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:46:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-11-20 11:46:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:46:35,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:35,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:46:35,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:46:35,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:46:35,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-20 11:46:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1214614811, now seen corresponding path program 1 times [2022-11-20 11:46:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:46:35,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559995342] [2022-11-20 11:46:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:35,708 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 [2022-11-20 11:46:35,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:46:35,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 11:46:35,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (10)] Waiting until timeout for monitored process [2022-11-20 11:46:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:46:36,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:46:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:46:36,284 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 11:46:36,284 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:46:36,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (57 of 58 remaining) [2022-11-20 11:46:36,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2022-11-20 11:46:36,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2022-11-20 11:46:36,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2022-11-20 11:46:36,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2022-11-20 11:46:36,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2022-11-20 11:46:36,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2022-11-20 11:46:36,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2022-11-20 11:46:36,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2022-11-20 11:46:36,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2022-11-20 11:46:36,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2022-11-20 11:46:36,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2022-11-20 11:46:36,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2022-11-20 11:46:36,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2022-11-20 11:46:36,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2022-11-20 11:46:36,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2022-11-20 11:46:36,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2022-11-20 11:46:36,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 58 remaining) [2022-11-20 11:46:36,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2022-11-20 11:46:36,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2022-11-20 11:46:36,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2022-11-20 11:46:36,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2022-11-20 11:46:36,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2022-11-20 11:46:36,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2022-11-20 11:46:36,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2022-11-20 11:46:36,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2022-11-20 11:46:36,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2022-11-20 11:46:36,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2022-11-20 11:46:36,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2022-11-20 11:46:36,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2022-11-20 11:46:36,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2022-11-20 11:46:36,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2022-11-20 11:46:36,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2022-11-20 11:46:36,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (24 of 58 remaining) [2022-11-20 11:46:36,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2022-11-20 11:46:36,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2022-11-20 11:46:36,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 58 remaining) [2022-11-20 11:46:36,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2022-11-20 11:46:36,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2022-11-20 11:46:36,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2022-11-20 11:46:36,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2022-11-20 11:46:36,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2022-11-20 11:46:36,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2022-11-20 11:46:36,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2022-11-20 11:46:36,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2022-11-20 11:46:36,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2022-11-20 11:46:36,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2022-11-20 11:46:36,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2022-11-20 11:46:36,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2022-11-20 11:46:36,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2022-11-20 11:46:36,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2022-11-20 11:46:36,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2022-11-20 11:46:36,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2022-11-20 11:46:36,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 58 remaining) [2022-11-20 11:46:36,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2022-11-20 11:46:36,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2022-11-20 11:46:36,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2022-11-20 11:46:36,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2022-11-20 11:46:36,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:46:36,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:46:36,520 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:46:36,527 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:46:36,527 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:46:36,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:46:36 BasicIcfg [2022-11-20 11:46:36,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:46:36,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:46:36,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:46:36,658 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:46:36,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:44:23" (3/4) ... [2022-11-20 11:46:36,662 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:46:36,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:46:36,663 INFO L158 Benchmark]: Toolchain (without parser) took 135401.21ms. Allocated memory was 81.8MB in the beginning and 872.4MB in the end (delta: 790.6MB). Free memory was 59.9MB in the beginning and 353.7MB in the end (delta: -293.8MB). Peak memory consumption was 495.9MB. Max. memory is 16.1GB. [2022-11-20 11:46:36,663 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 81.8MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:46:36,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.93ms. Allocated memory is still 81.8MB. Free memory was 59.9MB in the beginning and 58.0MB in the end (delta: 1.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2022-11-20 11:46:36,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.99ms. Allocated memory is still 81.8MB. Free memory was 58.0MB in the beginning and 55.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:46:36,665 INFO L158 Benchmark]: Boogie Preprocessor took 49.14ms. Allocated memory is still 81.8MB. Free memory was 55.6MB in the beginning and 53.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:46:36,666 INFO L158 Benchmark]: RCFGBuilder took 1798.09ms. Allocated memory was 81.8MB in the beginning and 138.4MB in the end (delta: 56.6MB). Free memory was 53.2MB in the beginning and 104.5MB in the end (delta: -51.3MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-11-20 11:46:36,666 INFO L158 Benchmark]: TraceAbstraction took 132669.03ms. Allocated memory was 138.4MB in the beginning and 872.4MB in the end (delta: 734.0MB). Free memory was 104.5MB in the beginning and 353.7MB in the end (delta: -249.2MB). Peak memory consumption was 483.8MB. Max. memory is 16.1GB. [2022-11-20 11:46:36,666 INFO L158 Benchmark]: Witness Printer took 10.04ms. Allocated memory is still 872.4MB. Free memory is still 353.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:46:36,669 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 81.8MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.93ms. Allocated memory is still 81.8MB. Free memory was 59.9MB in the beginning and 58.0MB in the end (delta: 1.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.99ms. Allocated memory is still 81.8MB. Free memory was 58.0MB in the beginning and 55.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.14ms. Allocated memory is still 81.8MB. Free memory was 55.6MB in the beginning and 53.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1798.09ms. Allocated memory was 81.8MB in the beginning and 138.4MB in the end (delta: 56.6MB). Free memory was 53.2MB in the beginning and 104.5MB in the end (delta: -51.3MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 132669.03ms. Allocated memory was 138.4MB in the beginning and 872.4MB in the end (delta: 734.0MB). Free memory was 104.5MB in the beginning and 353.7MB in the end (delta: -249.2MB). Peak memory consumption was 483.8MB. Max. memory is 16.1GB. * Witness Printer took 10.04ms. Allocated memory is still 872.4MB. Free memory is still 353.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.0s, 152 PlacesBefore, 60 PlacesAfterwards, 147 TransitionsBefore, 54 TransitionsAfterwards, 3768 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 11777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6637, independent: 6392, independent conditional: 0, independent unconditional: 6392, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 43, unknown conditional: 0, unknown unconditional: 43] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2590, independent: 2530, independent conditional: 0, independent unconditional: 2530, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2590, independent: 2282, independent conditional: 0, independent unconditional: 2282, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 308, independent: 248, independent conditional: 0, independent unconditional: 248, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7392, independent: 5558, independent conditional: 0, independent unconditional: 5558, dependent: 1420, dependent conditional: 0, dependent unconditional: 1420, unknown: 414, unknown conditional: 0, unknown unconditional: 414] ], Cache Queries: [ total: 6637, independent: 3862, independent conditional: 0, independent unconditional: 3862, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 2627, unknown conditional: 0, unknown unconditional: 2627] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 342, Positive conditional cache size: 0, Positive unconditional cache size: 342, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1921, ((void *)0), P0, ((void *)0))=0, t1921={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1922, ((void *)0), P1, ((void *)0))=1, t1921={-2147483642:0}, t1922={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={-2147483642:0}, t1922={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=128, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 185 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 132.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 69.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 30 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3178occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 55.7s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 39 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 [2022-11-20 11:46:36,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e2073d8-5866-43b1-ae16-2bfcd3e2c9a9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample