./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8 --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 384baf663e8fa66fe4dacec773bc2c5acf71b0d621e6212d04013b3fa3b41d51 --- 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-e04fb08 [2022-11-16 11:32:55,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:32:55,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:32:55,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:32:55,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:32:55,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:32:55,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:32:55,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:32:55,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:32:55,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:32:55,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:32:55,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:32:55,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:32:55,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:32:55,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:32:55,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:32:55,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:32:55,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:32:55,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:32:55,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:32:55,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:32:55,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:32:55,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:32:55,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:32:55,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:32:55,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:32:55,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:32:55,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:32:55,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:32:55,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:32:55,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:32:55,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:32:55,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:32:55,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:32:55,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:32:55,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:32:55,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:32:55,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:32:55,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:32:55,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:32:55,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:32:55,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:32:55,672 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:32:55,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:32:55,673 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:32:55,673 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:32:55,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:32:55,674 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:32:55,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:32:55,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:32:55,675 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:32:55,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:32:55,675 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:32:55,676 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:32:55,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:32:55,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:32:55,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:32:55,677 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:32:55,677 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:32:55,677 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:32:55,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:32:55,677 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:32:55,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:32:55,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:32:55,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:32:55,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:32:55,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:32:55,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:32:55,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:32:55,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:32:55,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:32:55,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:32:55,680 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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8 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 -> 384baf663e8fa66fe4dacec773bc2c5acf71b0d621e6212d04013b3fa3b41d51 [2022-11-16 11:32:55,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:32:55,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:32:56,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:32:56,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:32:56,004 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:32:56,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2022-11-16 11:32:56,097 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/c64511895/102e150769804270ac161d152f15b4d4/FLAGab5f1a87b [2022-11-16 11:32:56,726 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:32:56,726 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2022-11-16 11:32:56,754 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/c64511895/102e150769804270ac161d152f15b4d4/FLAGab5f1a87b [2022-11-16 11:32:57,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/c64511895/102e150769804270ac161d152f15b4d4 [2022-11-16 11:32:57,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:32:57,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:32:57,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:32:57,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:32:57,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:32:57,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a049a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57, skipping insertion in model container [2022-11-16 11:32:57,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:32:57,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:32:57,312 WARN L229 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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i[951,964] [2022-11-16 11:32:57,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:32:57,598 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:32:57,618 WARN L229 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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i[951,964] [2022-11-16 11:32:57,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:32:57,717 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:32:57,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57 WrapperNode [2022-11-16 11:32:57,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:32:57,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:32:57,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:32:57,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:32:57,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,774 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-11-16 11:32:57,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:32:57,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:32:57,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:32:57,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:32:57,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,802 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:32:57,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:32:57,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:32:57,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:32:57,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (1/1) ... [2022-11-16 11:32:57,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:32:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:32:57,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:32:57,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:32:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:32:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:32:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:32:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:32:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:32:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:32:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:32:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:32:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:32:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:32:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:32:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:32:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:32:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:32:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:32:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:32:57,906 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:32:58,177 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:32:58,179 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:32:58,944 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:32:59,584 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:32:59,585 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:32:59,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:59 BoogieIcfgContainer [2022-11-16 11:32:59,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:32:59,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:32:59,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:32:59,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:32:59,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:32:57" (1/3) ... [2022-11-16 11:32:59,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631e75e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:32:59, skipping insertion in model container [2022-11-16 11:32:59,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:57" (2/3) ... [2022-11-16 11:32:59,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631e75e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:32:59, skipping insertion in model container [2022-11-16 11:32:59,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:59" (3/3) ... [2022-11-16 11:32:59,600 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.opt.i [2022-11-16 11:32:59,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:32:59,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-16 11:32:59,620 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:32:59,743 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:32:59,777 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:32:59,792 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-16 11:32:59,795 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-16 11:32:59,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 371 flow [2022-11-16 11:32:59,915 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-11-16 11:32:59,915 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:32:59,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 2/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 245 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-16 11:32:59,927 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-16 11:33:18,465 INFO L134 LiptonReduction]: Checked pairs total: 34194 [2022-11-16 11:33:18,466 INFO L136 LiptonReduction]: Total number of compositions: 160 [2022-11-16 11:33:18,474 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-16 11:33:19,944 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-16 11:33:19,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:33:19,984 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;@3a815a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:33:19,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-16 11:33:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-16 11:33:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:33:20,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:20,038 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:33:20,039 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:20,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1139, now seen corresponding path program 1 times [2022-11-16 11:33:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:20,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121106790] [2022-11-16 11:33:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:20,165 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-16 11:33:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:20,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121106790] [2022-11-16 11:33:20,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121106790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:20,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:20,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:33:20,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084372940] [2022-11-16 11:33:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:20,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:33:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:33:20,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:33:20,237 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-16 11:33:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:20,754 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-16 11:33:20,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:33:20,756 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-16 11:33:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:20,942 INFO L225 Difference]: With dead ends: 15204 [2022-11-16 11:33:20,943 INFO L226 Difference]: Without dead ends: 15204 [2022-11-16 11:33:20,943 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-16 11:33:20,947 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:20,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-16 11:33:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-16 11:33:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 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-16 11:33:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-16 11:33:22,142 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-16 11:33:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:22,143 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-16 11:33:22,147 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-16 11:33:22,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-16 11:33:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:33:22,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:22,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:33:22,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:33:22,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash 34905411, now seen corresponding path program 1 times [2022-11-16 11:33:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:22,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45397160] [2022-11-16 11:33:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:22,617 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-16 11:33:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:22,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45397160] [2022-11-16 11:33:22,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45397160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:22,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:22,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:33:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228878847] [2022-11-16 11:33:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:22,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:22,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:22,628 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-16 11:33:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:23,130 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-16 11:33:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-16 11:33:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:23,364 INFO L225 Difference]: With dead ends: 13683 [2022-11-16 11:33:23,364 INFO L226 Difference]: Without dead ends: 13683 [2022-11-16 11:33:23,365 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-16 11:33:23,366 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:23,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:33:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-16 11:33:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-16 11:33:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 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-16 11:33:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-16 11:33:24,179 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-16 11:33:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:24,179 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-16 11:33:24,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-16 11:33:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-16 11:33:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:33:24,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:24,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:33:24,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:33:24,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1082068673, now seen corresponding path program 1 times [2022-11-16 11:33:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:24,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727806660] [2022-11-16 11:33:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:24,429 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-16 11:33:24,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:24,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727806660] [2022-11-16 11:33:24,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727806660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:24,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:24,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:33:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645787917] [2022-11-16 11:33:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:24,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:24,433 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 11:33:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:24,920 INFO L93 Difference]: Finished difference Result 9851 states and 32514 transitions. [2022-11-16 11:33:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:24,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-16 11:33:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:25,070 INFO L225 Difference]: With dead ends: 9851 [2022-11-16 11:33:25,070 INFO L226 Difference]: Without dead ends: 9851 [2022-11-16 11:33:25,071 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-16 11:33:25,072 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:25,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:33:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9851 states. [2022-11-16 11:33:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9851 to 8963. [2022-11-16 11:33:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8963 states, 8434 states have (on average 3.715200379416647) internal successors, (31334), 8962 states have internal predecessors, (31334), 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-16 11:33:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8963 states to 8963 states and 31334 transitions. [2022-11-16 11:33:25,714 INFO L78 Accepts]: Start accepts. Automaton has 8963 states and 31334 transitions. Word has length 5 [2022-11-16 11:33:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:25,725 INFO L495 AbstractCegarLoop]: Abstraction has 8963 states and 31334 transitions. [2022-11-16 11:33:25,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 11:33:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 8963 states and 31334 transitions. [2022-11-16 11:33:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:33:25,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:25,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:33:25,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:33:25,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1082068674, now seen corresponding path program 1 times [2022-11-16 11:33:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:25,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563726167] [2022-11-16 11:33:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:25,838 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-16 11:33:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563726167] [2022-11-16 11:33:25,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563726167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:25,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:25,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932597884] [2022-11-16 11:33:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:25,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:25,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:25,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:25,848 INFO L87 Difference]: Start difference. First operand 8963 states and 31334 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:33:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:26,172 INFO L93 Difference]: Finished difference Result 11450 states and 40305 transitions. [2022-11-16 11:33:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:26,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-16 11:33:26,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:26,235 INFO L225 Difference]: With dead ends: 11450 [2022-11-16 11:33:26,235 INFO L226 Difference]: Without dead ends: 11450 [2022-11-16 11:33:26,235 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-16 11:33:26,236 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:26,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:33:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2022-11-16 11:33:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 10048. [2022-11-16 11:33:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10048 states, 9523 states have (on average 3.845111834505933) internal successors, (36617), 10047 states have internal predecessors, (36617), 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-16 11:33:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10048 states to 10048 states and 36617 transitions. [2022-11-16 11:33:26,669 INFO L78 Accepts]: Start accepts. Automaton has 10048 states and 36617 transitions. Word has length 5 [2022-11-16 11:33:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:26,671 INFO L495 AbstractCegarLoop]: Abstraction has 10048 states and 36617 transitions. [2022-11-16 11:33:26,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:33:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10048 states and 36617 transitions. [2022-11-16 11:33:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:33:26,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:26,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:33:26,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:33:26,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1082068676, now seen corresponding path program 1 times [2022-11-16 11:33:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:26,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721440466] [2022-11-16 11:33:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:26,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:27,086 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-16 11:33:27,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721440466] [2022-11-16 11:33:27,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721440466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:27,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:27,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108885484] [2022-11-16 11:33:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:27,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:33:27,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:33:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:33:27,089 INFO L87 Difference]: Start difference. First operand 10048 states and 36617 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:33:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:27,345 INFO L93 Difference]: Finished difference Result 3788 states and 12310 transitions. [2022-11-16 11:33:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:33:27,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-16 11:33:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:27,364 INFO L225 Difference]: With dead ends: 3788 [2022-11-16 11:33:27,365 INFO L226 Difference]: Without dead ends: 3658 [2022-11-16 11:33:27,365 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-16 11:33:27,366 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:27,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 4 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:33:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2022-11-16 11:33:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3489. [2022-11-16 11:33:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 3415 states have (on average 3.330893118594436) internal successors, (11375), 3488 states have internal predecessors, (11375), 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-16 11:33:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 11375 transitions. [2022-11-16 11:33:27,495 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 11375 transitions. Word has length 5 [2022-11-16 11:33:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:27,495 INFO L495 AbstractCegarLoop]: Abstraction has 3489 states and 11375 transitions. [2022-11-16 11:33:27,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:33:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 11375 transitions. [2022-11-16 11:33:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:33:27,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:27,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:27,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:33:27,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 282394231, now seen corresponding path program 1 times [2022-11-16 11:33:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296495397] [2022-11-16 11:33:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:27,680 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-16 11:33:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:27,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296495397] [2022-11-16 11:33:27,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296495397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:27,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:27,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:33:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906365208] [2022-11-16 11:33:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:27,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:27,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:27,684 INFO L87 Difference]: Start difference. First operand 3489 states and 11375 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-16 11:33:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:27,853 INFO L93 Difference]: Finished difference Result 3439 states and 11195 transitions. [2022-11-16 11:33:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:27,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-16 11:33:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:27,870 INFO L225 Difference]: With dead ends: 3439 [2022-11-16 11:33:27,871 INFO L226 Difference]: Without dead ends: 3439 [2022-11-16 11:33:27,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-16 11:33:27,872 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:27,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2022-11-16 11:33:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 3439. [2022-11-16 11:33:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3365 states have (on average 3.3268945022288263) internal successors, (11195), 3438 states have internal predecessors, (11195), 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-16 11:33:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 11195 transitions. [2022-11-16 11:33:28,073 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 11195 transitions. Word has length 10 [2022-11-16 11:33:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:28,073 INFO L495 AbstractCegarLoop]: Abstraction has 3439 states and 11195 transitions. [2022-11-16 11:33:28,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-16 11:33:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 11195 transitions. [2022-11-16 11:33:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:33:28,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:28,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:28,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:33:28,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 165581047, now seen corresponding path program 1 times [2022-11-16 11:33:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:28,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469065966] [2022-11-16 11:33:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:28,270 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-16 11:33:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:28,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469065966] [2022-11-16 11:33:28,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469065966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:28,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:28,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11726816] [2022-11-16 11:33:28,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:28,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:28,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:28,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:28,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:28,272 INFO L87 Difference]: Start difference. First operand 3439 states and 11195 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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-16 11:33:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:28,416 INFO L93 Difference]: Finished difference Result 3857 states and 12237 transitions. [2022-11-16 11:33:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:28,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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-16 11:33:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:28,431 INFO L225 Difference]: With dead ends: 3857 [2022-11-16 11:33:28,431 INFO L226 Difference]: Without dead ends: 3857 [2022-11-16 11:33:28,432 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-16 11:33:28,432 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:28,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2022-11-16 11:33:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3339. [2022-11-16 11:33:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3339 states, 3266 states have (on average 3.3251684017146355) internal successors, (10860), 3338 states have internal predecessors, (10860), 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-16 11:33:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 10860 transitions. [2022-11-16 11:33:28,523 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 10860 transitions. Word has length 11 [2022-11-16 11:33:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:28,523 INFO L495 AbstractCegarLoop]: Abstraction has 3339 states and 10860 transitions. [2022-11-16 11:33:28,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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-16 11:33:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 10860 transitions. [2022-11-16 11:33:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:33:28,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:28,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:28,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:33:28,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 165581048, now seen corresponding path program 1 times [2022-11-16 11:33:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:28,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296431065] [2022-11-16 11:33:28,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:29,132 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-16 11:33:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:29,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296431065] [2022-11-16 11:33:29,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296431065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:29,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:29,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202963031] [2022-11-16 11:33:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:29,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:33:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:33:29,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:33:29,136 INFO L87 Difference]: Start difference. First operand 3339 states and 10860 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-16 11:33:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:29,458 INFO L93 Difference]: Finished difference Result 5663 states and 18385 transitions. [2022-11-16 11:33:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:33:29,459 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-16 11:33:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:29,489 INFO L225 Difference]: With dead ends: 5663 [2022-11-16 11:33:29,489 INFO L226 Difference]: Without dead ends: 5663 [2022-11-16 11:33:29,489 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-16 11:33:29,490 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:29,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 9 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:33:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5663 states. [2022-11-16 11:33:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5663 to 3579. [2022-11-16 11:33:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 3506 states have (on average 3.317741015402168) internal successors, (11632), 3578 states have internal predecessors, (11632), 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-16 11:33:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 11632 transitions. [2022-11-16 11:33:29,639 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 11632 transitions. Word has length 11 [2022-11-16 11:33:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:29,640 INFO L495 AbstractCegarLoop]: Abstraction has 3579 states and 11632 transitions. [2022-11-16 11:33:29,640 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-16 11:33:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 11632 transitions. [2022-11-16 11:33:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:33:29,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:29,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:29,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:33:29,642 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash 164281356, now seen corresponding path program 1 times [2022-11-16 11:33:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:29,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433559719] [2022-11-16 11:33:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:29,823 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-16 11:33:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:29,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433559719] [2022-11-16 11:33:29,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433559719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:29,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:29,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:33:29,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702413724] [2022-11-16 11:33:29,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:29,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:29,826 INFO L87 Difference]: Start difference. First operand 3579 states and 11632 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-16 11:33:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:29,969 INFO L93 Difference]: Finished difference Result 3554 states and 11537 transitions. [2022-11-16 11:33:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-16 11:33:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:29,988 INFO L225 Difference]: With dead ends: 3554 [2022-11-16 11:33:29,988 INFO L226 Difference]: Without dead ends: 3554 [2022-11-16 11:33:29,988 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-16 11:33:29,989 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:29,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2022-11-16 11:33:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3554. [2022-11-16 11:33:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 3481 states have (on average 3.31427750646366) internal successors, (11537), 3553 states have internal predecessors, (11537), 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-16 11:33:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 11537 transitions. [2022-11-16 11:33:30,108 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 11537 transitions. Word has length 11 [2022-11-16 11:33:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:30,109 INFO L495 AbstractCegarLoop]: Abstraction has 3554 states and 11537 transitions. [2022-11-16 11:33:30,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-16 11:33:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 11537 transitions. [2022-11-16 11:33:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:33:30,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:30,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:30,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:33:30,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:30,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1454751442, now seen corresponding path program 2 times [2022-11-16 11:33:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:30,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016946338] [2022-11-16 11:33:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:30,570 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-16 11:33:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016946338] [2022-11-16 11:33:30,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016946338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:30,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:30,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:33:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947483997] [2022-11-16 11:33:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:33:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:33:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:33:30,573 INFO L87 Difference]: Start difference. First operand 3554 states and 11537 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 11:33:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:30,974 INFO L93 Difference]: Finished difference Result 5344 states and 16985 transitions. [2022-11-16 11:33:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:33:30,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 11:33:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:30,997 INFO L225 Difference]: With dead ends: 5344 [2022-11-16 11:33:30,998 INFO L226 Difference]: Without dead ends: 5344 [2022-11-16 11:33:30,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:33:30,999 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:30,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 13 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:33:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2022-11-16 11:33:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 3430. [2022-11-16 11:33:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3430 states, 3357 states have (on average 3.3053321417932677) internal successors, (11096), 3429 states have internal predecessors, (11096), 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-16 11:33:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 11096 transitions. [2022-11-16 11:33:31,137 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 11096 transitions. Word has length 11 [2022-11-16 11:33:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:31,138 INFO L495 AbstractCegarLoop]: Abstraction has 3430 states and 11096 transitions. [2022-11-16 11:33:31,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 11:33:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 11096 transitions. [2022-11-16 11:33:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:33:31,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:31,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:31,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:33:31,141 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:31,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:31,141 INFO L85 PathProgramCache]: Analyzing trace with hash 794128014, now seen corresponding path program 1 times [2022-11-16 11:33:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:31,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319821589] [2022-11-16 11:33:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:31,316 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-16 11:33:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319821589] [2022-11-16 11:33:31,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319821589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:31,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:31,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:33:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197084668] [2022-11-16 11:33:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:31,319 INFO L87 Difference]: Start difference. First operand 3430 states and 11096 transitions. Second operand has 3 states, 2 states have (on average 6.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-16 11:33:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:31,452 INFO L93 Difference]: Finished difference Result 3425 states and 11077 transitions. [2022-11-16 11:33:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.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-16 11:33:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:31,467 INFO L225 Difference]: With dead ends: 3425 [2022-11-16 11:33:31,467 INFO L226 Difference]: Without dead ends: 3425 [2022-11-16 11:33:31,467 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-16 11:33:31,468 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:31,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2022-11-16 11:33:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3425. [2022-11-16 11:33:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3425 states, 3352 states have (on average 3.3045942720763724) internal successors, (11077), 3424 states have internal predecessors, (11077), 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-16 11:33:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 11077 transitions. [2022-11-16 11:33:31,579 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 11077 transitions. Word has length 12 [2022-11-16 11:33:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:31,579 INFO L495 AbstractCegarLoop]: Abstraction has 3425 states and 11077 transitions. [2022-11-16 11:33:31,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.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-16 11:33:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 11077 transitions. [2022-11-16 11:33:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:33:31,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:31,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:31,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:33:31,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1150017658, now seen corresponding path program 1 times [2022-11-16 11:33:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:31,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879099317] [2022-11-16 11:33:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:31,986 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-16 11:33:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:31,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879099317] [2022-11-16 11:33:31,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879099317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:31,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:31,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:33:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425384727] [2022-11-16 11:33:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:31,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:33:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:33:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:33:31,989 INFO L87 Difference]: Start difference. First operand 3425 states and 11077 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 11:33:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:32,319 INFO L93 Difference]: Finished difference Result 5847 states and 18901 transitions. [2022-11-16 11:33:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:33:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 11:33:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:32,337 INFO L225 Difference]: With dead ends: 5847 [2022-11-16 11:33:32,337 INFO L226 Difference]: Without dead ends: 5847 [2022-11-16 11:33:32,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:33:32,338 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:32,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 8 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:33:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2022-11-16 11:33:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 3425. [2022-11-16 11:33:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3425 states, 3352 states have (on average 3.3045942720763724) internal successors, (11077), 3424 states have internal predecessors, (11077), 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-16 11:33:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 11077 transitions. [2022-11-16 11:33:32,483 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 11077 transitions. Word has length 13 [2022-11-16 11:33:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:32,484 INFO L495 AbstractCegarLoop]: Abstraction has 3425 states and 11077 transitions. [2022-11-16 11:33:32,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 11:33:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 11077 transitions. [2022-11-16 11:33:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:33:32,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:32,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:32,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:33:32,486 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash -470314832, now seen corresponding path program 2 times [2022-11-16 11:33:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:32,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238212767] [2022-11-16 11:33:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:33,171 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-16 11:33:33,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:33,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238212767] [2022-11-16 11:33:33,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238212767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:33,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:33,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:33:33,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845836342] [2022-11-16 11:33:33,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:33,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:33:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:33:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:33:33,174 INFO L87 Difference]: Start difference. First operand 3425 states and 11077 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-16 11:33:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:33,509 INFO L93 Difference]: Finished difference Result 3365 states and 10884 transitions. [2022-11-16 11:33:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:33:33,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-16 11:33:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:33,520 INFO L225 Difference]: With dead ends: 3365 [2022-11-16 11:33:33,520 INFO L226 Difference]: Without dead ends: 3365 [2022-11-16 11:33:33,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:33:33,521 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:33,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 8 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:33:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2022-11-16 11:33:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3209. [2022-11-16 11:33:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 3137 states have (on average 3.318775900541919) internal successors, (10411), 3208 states have internal predecessors, (10411), 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-16 11:33:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 10411 transitions. [2022-11-16 11:33:33,633 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 10411 transitions. Word has length 13 [2022-11-16 11:33:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:33,633 INFO L495 AbstractCegarLoop]: Abstraction has 3209 states and 10411 transitions. [2022-11-16 11:33:33,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-16 11:33:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 10411 transitions. [2022-11-16 11:33:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:33:33,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:33,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:33,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:33:33,636 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1116246258, now seen corresponding path program 1 times [2022-11-16 11:33:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:33,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173446107] [2022-11-16 11:33:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:33,829 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-16 11:33:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:33,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173446107] [2022-11-16 11:33:33,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173446107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:33,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:33,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030047895] [2022-11-16 11:33:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:33,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:33:33,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:33,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:33:33,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:33:33,832 INFO L87 Difference]: Start difference. First operand 3209 states and 10411 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-16 11:33:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:34,016 INFO L93 Difference]: Finished difference Result 4671 states and 15042 transitions. [2022-11-16 11:33:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:33:34,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-16 11:33:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:34,036 INFO L225 Difference]: With dead ends: 4671 [2022-11-16 11:33:34,036 INFO L226 Difference]: Without dead ends: 4671 [2022-11-16 11:33:34,036 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-16 11:33:34,037 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 69 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:34,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 4 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2022-11-16 11:33:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 3363. [2022-11-16 11:33:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 3291 states have (on average 3.3087207535703436) internal successors, (10889), 3362 states have internal predecessors, (10889), 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-16 11:33:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 10889 transitions. [2022-11-16 11:33:34,154 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 10889 transitions. Word has length 13 [2022-11-16 11:33:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:34,154 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 10889 transitions. [2022-11-16 11:33:34,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-16 11:33:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 10889 transitions. [2022-11-16 11:33:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:33:34,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:34,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:34,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:33:34,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1039373194, now seen corresponding path program 1 times [2022-11-16 11:33:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:34,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759134624] [2022-11-16 11:33:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:34,316 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-16 11:33:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:34,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759134624] [2022-11-16 11:33:34,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759134624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:34,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:34,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:33:34,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936834595] [2022-11-16 11:33:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:34,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:33:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:34,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:33:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:33:34,319 INFO L87 Difference]: Start difference. First operand 3363 states and 10889 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 11:33:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:34,474 INFO L93 Difference]: Finished difference Result 3177 states and 9837 transitions. [2022-11-16 11:33:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:33:34,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 11:33:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:34,484 INFO L225 Difference]: With dead ends: 3177 [2022-11-16 11:33:34,485 INFO L226 Difference]: Without dead ends: 3177 [2022-11-16 11:33:34,485 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-16 11:33:34,486 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:34,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 8 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2022-11-16 11:33:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2851. [2022-11-16 11:33:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2779 states have (on average 3.276718243972652) internal successors, (9106), 2850 states have internal predecessors, (9106), 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-16 11:33:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 9106 transitions. [2022-11-16 11:33:34,555 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 9106 transitions. Word has length 13 [2022-11-16 11:33:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:34,556 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 9106 transitions. [2022-11-16 11:33:34,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 11:33:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 9106 transitions. [2022-11-16 11:33:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:33:34,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:34,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:34,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:33:34,558 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:34,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2139170725, now seen corresponding path program 1 times [2022-11-16 11:33:34,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:34,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682838143] [2022-11-16 11:33:34,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:35,035 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-16 11:33:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:35,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682838143] [2022-11-16 11:33:35,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682838143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:35,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:35,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:33:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591809941] [2022-11-16 11:33:35,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:33:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:33:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:33:35,037 INFO L87 Difference]: Start difference. First operand 2851 states and 9106 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-16 11:33:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:35,651 INFO L93 Difference]: Finished difference Result 2219 states and 6877 transitions. [2022-11-16 11:33:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:33:35,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-16 11:33:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:35,658 INFO L225 Difference]: With dead ends: 2219 [2022-11-16 11:33:35,658 INFO L226 Difference]: Without dead ends: 2171 [2022-11-16 11:33:35,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:33:35,659 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 117 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:35,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 41 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:33:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-11-16 11:33:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2171. [2022-11-16 11:33:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 2135 states have (on average 3.11615925058548) internal successors, (6653), 2170 states have internal predecessors, (6653), 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-16 11:33:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 6653 transitions. [2022-11-16 11:33:35,711 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 6653 transitions. Word has length 14 [2022-11-16 11:33:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:35,712 INFO L495 AbstractCegarLoop]: Abstraction has 2171 states and 6653 transitions. [2022-11-16 11:33:35,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-16 11:33:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 6653 transitions. [2022-11-16 11:33:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:33:35,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:35,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:35,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:33:35,714 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2139170663, now seen corresponding path program 1 times [2022-11-16 11:33:35,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:35,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584395352] [2022-11-16 11:33:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:35,972 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-16 11:33:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584395352] [2022-11-16 11:33:35,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584395352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:35,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:35,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:33:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121685952] [2022-11-16 11:33:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:35,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:33:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:33:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:33:35,974 INFO L87 Difference]: Start difference. First operand 2171 states and 6653 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-16 11:33:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:36,273 INFO L93 Difference]: Finished difference Result 1849 states and 5361 transitions. [2022-11-16 11:33:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:33:36,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-16 11:33:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:36,280 INFO L225 Difference]: With dead ends: 1849 [2022-11-16 11:33:36,280 INFO L226 Difference]: Without dead ends: 1849 [2022-11-16 11:33:36,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:33:36,281 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 82 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:36,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 14 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:33:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2022-11-16 11:33:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1659. [2022-11-16 11:33:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1623 states have (on average 3.010474430067776) internal successors, (4886), 1658 states have internal predecessors, (4886), 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-16 11:33:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 4886 transitions. [2022-11-16 11:33:36,319 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 4886 transitions. Word has length 14 [2022-11-16 11:33:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:36,320 INFO L495 AbstractCegarLoop]: Abstraction has 1659 states and 4886 transitions. [2022-11-16 11:33:36,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-16 11:33:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 4886 transitions. [2022-11-16 11:33:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:33:36,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:36,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:36,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:33:36,322 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 278749607, now seen corresponding path program 1 times [2022-11-16 11:33:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:36,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576101297] [2022-11-16 11:33:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:37,856 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-16 11:33:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576101297] [2022-11-16 11:33:37,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576101297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:37,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:37,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:33:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230360350] [2022-11-16 11:33:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:37,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:33:37,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:37,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:33:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:33:37,858 INFO L87 Difference]: Start difference. First operand 1659 states and 4886 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-16 11:33:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:38,423 INFO L93 Difference]: Finished difference Result 1766 states and 5231 transitions. [2022-11-16 11:33:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:33:38,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2022-11-16 11:33:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:38,428 INFO L225 Difference]: With dead ends: 1766 [2022-11-16 11:33:38,429 INFO L226 Difference]: Without dead ends: 1766 [2022-11-16 11:33:38,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:33:38,429 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 81 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:38,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 18 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:33:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2022-11-16 11:33:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1670. [2022-11-16 11:33:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1634 states have (on average 3.01468788249694) internal successors, (4926), 1669 states have internal predecessors, (4926), 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-16 11:33:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4926 transitions. [2022-11-16 11:33:38,464 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4926 transitions. Word has length 15 [2022-11-16 11:33:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:38,466 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 4926 transitions. [2022-11-16 11:33:38,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-16 11:33:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4926 transitions. [2022-11-16 11:33:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:33:38,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:38,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:38,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:33:38,469 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1889784747, now seen corresponding path program 1 times [2022-11-16 11:33:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:38,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961322734] [2022-11-16 11:33:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:38,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-16 11:33:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961322734] [2022-11-16 11:33:38,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961322734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:38,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:38,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:38,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700313677] [2022-11-16 11:33:38,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:38,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:33:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:38,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:33:38,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:33:38,560 INFO L87 Difference]: Start difference. First operand 1670 states and 4926 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 11:33:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:38,654 INFO L93 Difference]: Finished difference Result 1556 states and 4847 transitions. [2022-11-16 11:33:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:33:38,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-16 11:33:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:38,658 INFO L225 Difference]: With dead ends: 1556 [2022-11-16 11:33:38,658 INFO L226 Difference]: Without dead ends: 432 [2022-11-16 11:33:38,659 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-16 11:33:38,659 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:38,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-16 11:33:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 415. [2022-11-16 11:33:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 2.8381642512077296) internal successors, (1175), 414 states have internal predecessors, (1175), 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-16 11:33:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1175 transitions. [2022-11-16 11:33:38,668 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1175 transitions. Word has length 15 [2022-11-16 11:33:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:38,668 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 1175 transitions. [2022-11-16 11:33:38,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 11:33:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1175 transitions. [2022-11-16 11:33:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:33:38,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:38,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:38,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:33:38,670 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -783226267, now seen corresponding path program 1 times [2022-11-16 11:33:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:38,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104836610] [2022-11-16 11:33:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:38,896 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-16 11:33:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:38,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104836610] [2022-11-16 11:33:38,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104836610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:38,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:38,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482592509] [2022-11-16 11:33:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:38,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:38,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:38,898 INFO L87 Difference]: Start difference. First operand 415 states and 1175 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-16 11:33:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:38,975 INFO L93 Difference]: Finished difference Result 308 states and 765 transitions. [2022-11-16 11:33:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:38,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2022-11-16 11:33:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:38,977 INFO L225 Difference]: With dead ends: 308 [2022-11-16 11:33:38,977 INFO L226 Difference]: Without dead ends: 308 [2022-11-16 11:33:38,977 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-16 11:33:38,977 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:38,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-16 11:33:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2022-11-16 11:33:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.485049833887043) internal successors, (748), 301 states have internal predecessors, (748), 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-16 11:33:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 748 transitions. [2022-11-16 11:33:38,984 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 748 transitions. Word has length 16 [2022-11-16 11:33:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:38,985 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 748 transitions. [2022-11-16 11:33:38,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-16 11:33:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 748 transitions. [2022-11-16 11:33:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:33:38,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:38,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:38,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:33:38,987 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1073658647, now seen corresponding path program 1 times [2022-11-16 11:33:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:38,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575992755] [2022-11-16 11:33:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:40,658 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-16 11:33:40,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:40,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575992755] [2022-11-16 11:33:40,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575992755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:40,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:40,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:33:40,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043608391] [2022-11-16 11:33:40,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:40,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:33:40,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:33:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:33:40,660 INFO L87 Difference]: Start difference. First operand 302 states and 748 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-16 11:33:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:41,188 INFO L93 Difference]: Finished difference Result 333 states and 829 transitions. [2022-11-16 11:33:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:33:41,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2022-11-16 11:33:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:41,190 INFO L225 Difference]: With dead ends: 333 [2022-11-16 11:33:41,190 INFO L226 Difference]: Without dead ends: 333 [2022-11-16 11:33:41,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:33:41,191 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:41,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 16 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:33:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-16 11:33:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 319. [2022-11-16 11:33:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 2.4842767295597485) internal successors, (790), 318 states have internal predecessors, (790), 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-16 11:33:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 790 transitions. [2022-11-16 11:33:41,197 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 790 transitions. Word has length 17 [2022-11-16 11:33:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:41,197 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 790 transitions. [2022-11-16 11:33:41,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-16 11:33:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 790 transitions. [2022-11-16 11:33:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:33:41,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:41,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:41,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:33:41,199 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1981523420, now seen corresponding path program 1 times [2022-11-16 11:33:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:41,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501846079] [2022-11-16 11:33:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:41,491 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-16 11:33:41,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:41,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501846079] [2022-11-16 11:33:41,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501846079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:41,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:41,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:33:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602276113] [2022-11-16 11:33:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:41,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:33:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:33:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:33:41,493 INFO L87 Difference]: Start difference. First operand 319 states and 790 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-16 11:33:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:41,590 INFO L93 Difference]: Finished difference Result 223 states and 506 transitions. [2022-11-16 11:33:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:33:41,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-11-16 11:33:41,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:41,592 INFO L225 Difference]: With dead ends: 223 [2022-11-16 11:33:41,592 INFO L226 Difference]: Without dead ends: 223 [2022-11-16 11:33:41,592 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-16 11:33:41,592 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:41,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-16 11:33:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2022-11-16 11:33:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.268867924528302) internal successors, (481), 212 states have internal predecessors, (481), 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-16 11:33:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 481 transitions. [2022-11-16 11:33:41,597 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 481 transitions. Word has length 18 [2022-11-16 11:33:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:41,597 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 481 transitions. [2022-11-16 11:33:41,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-16 11:33:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 481 transitions. [2022-11-16 11:33:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:33:41,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:41,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:41,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:33:41,598 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1090564130, now seen corresponding path program 1 times [2022-11-16 11:33:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:41,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539282149] [2022-11-16 11:33:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:41,945 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-16 11:33:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539282149] [2022-11-16 11:33:41,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539282149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:41,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:41,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:33:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970780254] [2022-11-16 11:33:41,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:41,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:33:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:41,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:33:41,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:33:41,949 INFO L87 Difference]: Start difference. First operand 213 states and 481 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-16 11:33:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:42,054 INFO L93 Difference]: Finished difference Result 184 states and 423 transitions. [2022-11-16 11:33:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:33:42,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-16 11:33:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:42,056 INFO L225 Difference]: With dead ends: 184 [2022-11-16 11:33:42,056 INFO L226 Difference]: Without dead ends: 184 [2022-11-16 11:33:42,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 11:33:42,056 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 63 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:42,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 5 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-16 11:33:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-11-16 11:33:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.3184357541899443) internal successors, (415), 179 states have internal predecessors, (415), 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-16 11:33:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 415 transitions. [2022-11-16 11:33:42,060 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 415 transitions. Word has length 20 [2022-11-16 11:33:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:42,060 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 415 transitions. [2022-11-16 11:33:42,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-16 11:33:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 415 transitions. [2022-11-16 11:33:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:33:42,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:42,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:42,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:33:42,061 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1931318632, now seen corresponding path program 1 times [2022-11-16 11:33:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:42,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548956218] [2022-11-16 11:33:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:42,365 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-16 11:33:42,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:42,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548956218] [2022-11-16 11:33:42,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548956218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:42,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:42,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:42,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011468229] [2022-11-16 11:33:42,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:42,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:42,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:42,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:42,368 INFO L87 Difference]: Start difference. First operand 180 states and 415 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-16 11:33:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:33:42,438 INFO L93 Difference]: Finished difference Result 218 states and 492 transitions. [2022-11-16 11:33:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:42,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-11-16 11:33:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:33:42,439 INFO L225 Difference]: With dead ends: 218 [2022-11-16 11:33:42,439 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 11:33:42,439 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-16 11:33:42,440 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:33:42,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:33:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 11:33:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 11:33:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 75 states have internal predecessors, (143), 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-16 11:33:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions. [2022-11-16 11:33:42,442 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 23 [2022-11-16 11:33:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:33:42,442 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 143 transitions. [2022-11-16 11:33:42,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-16 11:33:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions. [2022-11-16 11:33:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:33:42,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:33:42,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:42,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:33:42,443 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:33:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1369453600, now seen corresponding path program 2 times [2022-11-16 11:33:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:42,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585198983] [2022-11-16 11:33:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:33:42,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:33:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:33:42,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:33:42,750 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:33:42,751 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-16 11:33:42,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-16 11:33:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-16 11:33:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-16 11:33:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-16 11:33:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-16 11:33:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-16 11:33:42,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-16 11:33:42,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-16 11:33:42,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-16 11:33:42,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-16 11:33:42,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-16 11:33:42,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-16 11:33:42,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-16 11:33:42,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-16 11:33:42,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-16 11:33:42,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-16 11:33:42,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-16 11:33:42,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-16 11:33:42,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-16 11:33:42,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-16 11:33:42,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-16 11:33:42,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-16 11:33:42,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-16 11:33:42,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-16 11:33:42,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-16 11:33:42,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-16 11:33:42,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-16 11:33:42,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-16 11:33:42,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-16 11:33:42,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-16 11:33:42,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-16 11:33:42,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-16 11:33:42,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-16 11:33:42,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-16 11:33:42,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-16 11:33:42,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-16 11:33:42,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-16 11:33:42,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-16 11:33:42,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-16 11:33:42,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-16 11:33:42,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-16 11:33:42,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-16 11:33:42,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-16 11:33:42,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-16 11:33:42,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-16 11:33:42,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-16 11:33:42,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-16 11:33:42,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-16 11:33:42,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-16 11:33:42,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-16 11:33:42,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-16 11:33:42,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-16 11:33:42,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-16 11:33:42,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-16 11:33:42,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-16 11:33:42,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-16 11:33:42,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-16 11:33:42,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-16 11:33:42,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-16 11:33:42,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-16 11:33:42,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-16 11:33:42,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-16 11:33:42,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-16 11:33:42,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-16 11:33:42,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-16 11:33:42,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-16 11:33:42,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-16 11:33:42,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-16 11:33:42,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-16 11:33:42,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-16 11:33:42,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-16 11:33:42,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-16 11:33:42,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-16 11:33:42,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-16 11:33:42,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:33:42,769 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:42,774 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:33:42,774 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:33:42,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:33:42 BasicIcfg [2022-11-16 11:33:42,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:33:42,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:33:42,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:33:42,854 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:33:42,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:59" (3/4) ... [2022-11-16 11:33:42,858 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:33:42,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:33:42,859 INFO L158 Benchmark]: Toolchain (without parser) took 45848.22ms. Allocated memory was 136.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 98.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 811.2MB. Max. memory is 16.1GB. [2022-11-16 11:33:42,859 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 136.3MB. Free memory was 109.2MB in the beginning and 109.2MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:33:42,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.75ms. Allocated memory is still 136.3MB. Free memory was 98.3MB in the beginning and 96.6MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:33:42,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.99ms. Allocated memory is still 136.3MB. Free memory was 96.6MB in the beginning and 93.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:33:42,860 INFO L158 Benchmark]: Boogie Preprocessor took 33.34ms. Allocated memory is still 136.3MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:33:42,860 INFO L158 Benchmark]: RCFGBuilder took 1779.59ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 91.6MB in the beginning and 103.2MB in the end (delta: -11.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-11-16 11:33:42,861 INFO L158 Benchmark]: TraceAbstraction took 43260.39ms. Allocated memory was 178.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 103.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 774.0MB. Max. memory is 16.1GB. [2022-11-16 11:33:42,861 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 2.3GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:33:42,863 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.56ms. Allocated memory is still 136.3MB. Free memory was 109.2MB in the beginning and 109.2MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.75ms. Allocated memory is still 136.3MB. Free memory was 98.3MB in the beginning and 96.6MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.99ms. Allocated memory is still 136.3MB. Free memory was 96.6MB in the beginning and 93.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.34ms. Allocated memory is still 136.3MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1779.59ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 91.6MB in the beginning and 103.2MB in the end (delta: -11.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * TraceAbstraction took 43260.39ms. Allocated memory was 178.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 103.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 774.0MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 2.3GB. Free memory is still 1.5GB. 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: 18.7s, 186 PlacesBefore, 82 PlacesAfterwards, 178 TransitionsBefore, 73 TransitionsAfterwards, 6624 CoEnabledTransitionPairs, 8 FixpointIterations, 75 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 160 TotalNumberOfCompositions, 34194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10097, independent: 9484, independent conditional: 0, independent unconditional: 9484, dependent: 560, dependent conditional: 0, dependent unconditional: 560, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3526, independent: 3430, independent conditional: 0, independent unconditional: 3430, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3526, independent: 3262, independent conditional: 0, independent unconditional: 3262, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 264, independent: 168, independent conditional: 0, independent unconditional: 168, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1375, independent: 736, independent conditional: 0, independent unconditional: 736, dependent: 531, dependent conditional: 0, dependent unconditional: 531, unknown: 108, unknown conditional: 0, unknown unconditional: 108] ], Cache Queries: [ total: 10097, independent: 6054, independent conditional: 0, independent unconditional: 6054, dependent: 470, dependent conditional: 0, dependent unconditional: 470, unknown: 3573, unknown conditional: 0, unknown unconditional: 3573] , Statistics on independence cache: Total cache size (in pairs): 604, Positive cache size: 553, Positive conditional cache size: 0, Positive unconditional cache size: 553, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L734] 0 _Bool x$flush_delayed; [L745] 0 int *x$read_delayed_var; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L739] 0 _Bool x$r_buff0_thd3; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L744] 0 _Bool x$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L749] 0 _Bool x$w_buff1_used; [L746] 0 int x$w_buff0; [L748] 0 int x$w_buff1; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L735] 0 int x$mem_tmp; [L711] 0 int __unbuffered_p1_EAX = 0; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard1; [L730] 0 _Bool main$tmp_guard0; [L747] 0 _Bool x$w_buff0_used; [L733] 0 int x = 0; [L741] 0 _Bool x$r_buff1_thd1; [L740] 0 _Bool x$r_buff1_thd0; [L751] 0 int y = 0; [L753] 0 int z = 0; [L743] 0 _Bool x$r_buff1_thd3; [L742] 0 _Bool x$r_buff1_thd2; [L853] 0 pthread_t t1964; [L854] FCALL, FORK 0 pthread_create(&t1964, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1964, ((void *)0), P0, ((void *)0))=-2, t1964={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t1965; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1964={7:0}, t1965={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t1965, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1965, ((void *)0), P1, ((void *)0))=-1, t1964={7:0}, t1965={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t1966; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t1966, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1966, ((void *)0), P2, ((void *)0))=0, t1964={7:0}, t1965={5:0}, t1966={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L828] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1964={7:0}, t1965={5:0}, t1966={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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 7 procedures, 233 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 43.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1205 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1205 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2687 IncrementalHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 63 mSDtfsCounter, 2687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35046occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 11524 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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-16 11:33:42,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8 --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 384baf663e8fa66fe4dacec773bc2c5acf71b0d621e6212d04013b3fa3b41d51 --- 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-e04fb08 [2022-11-16 11:33:45,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:33:45,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:33:45,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:33:45,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:33:45,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:33:45,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:33:45,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:33:45,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:33:45,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:33:45,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:33:45,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:33:45,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:33:45,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:33:45,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:33:45,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:33:45,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:33:45,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:33:45,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:33:45,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:33:45,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:33:45,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:33:45,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:33:45,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:33:45,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:33:45,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:33:45,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:33:45,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:33:45,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:33:45,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:33:45,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:33:45,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:33:45,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:33:45,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:33:45,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:33:45,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:33:45,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:33:45,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:33:45,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:33:45,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:33:45,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:33:45,475 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:33:45,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:33:45,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:33:45,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:33:45,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:33:45,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:33:45,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:33:45,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:33:45,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:33:45,529 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:33:45,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:33:45,530 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:33:45,531 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:33:45,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:33:45,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:33:45,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:33:45,532 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:33:45,532 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:33:45,532 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:33:45,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:33:45,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:33:45,533 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:33:45,533 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:33:45,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:33:45,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:33:45,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:33:45,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:33:45,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:33:45,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:33:45,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:33:45,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:33:45,535 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:33:45,536 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:33:45,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:33:45,536 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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8 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 -> 384baf663e8fa66fe4dacec773bc2c5acf71b0d621e6212d04013b3fa3b41d51 [2022-11-16 11:33:45,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:33:45,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:33:45,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:33:45,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:33:45,958 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:33:45,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2022-11-16 11:33:46,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/0a623eb1b/5c4bb4f45d114a4f99270e7f395b4bed/FLAGf52c36af1 [2022-11-16 11:33:46,691 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:33:46,692 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2022-11-16 11:33:46,704 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/0a623eb1b/5c4bb4f45d114a4f99270e7f395b4bed/FLAGf52c36af1 [2022-11-16 11:33:46,927 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/data/0a623eb1b/5c4bb4f45d114a4f99270e7f395b4bed [2022-11-16 11:33:46,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:33:46,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:33:46,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:33:46,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:33:46,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:33:46,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:33:46" (1/1) ... [2022-11-16 11:33:46,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43125b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:46, skipping insertion in model container [2022-11-16 11:33:46,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:33:46" (1/1) ... [2022-11-16 11:33:46,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:33:47,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:33:47,240 WARN L229 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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i[951,964] [2022-11-16 11:33:47,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:33:47,565 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:33:47,581 WARN L229 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_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i[951,964] [2022-11-16 11:33:47,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:33:47,667 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:33:47,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47 WrapperNode [2022-11-16 11:33:47,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:33:47,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:33:47,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:33:47,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:33:47,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,732 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-11-16 11:33:47,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:33:47,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:33:47,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:33:47,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:33:47,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,812 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:33:47,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:33:47,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:33:47,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:33:47,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (1/1) ... [2022-11-16 11:33:47,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:33:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:33:47,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:33:47,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:33:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:33:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:33:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:33:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:33:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:33:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:33:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:33:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 11:33:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:33:47,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:33:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:33:47,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:33:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:33:47,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:33:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:33:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:33:47,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:33:47,920 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:33:48,129 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:33:48,131 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:33:48,911 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:33:49,688 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:33:49,689 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:33:49,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:33:49 BoogieIcfgContainer [2022-11-16 11:33:49,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:33:49,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:33:49,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:33:49,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:33:49,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:33:46" (1/3) ... [2022-11-16 11:33:49,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f248211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:33:49, skipping insertion in model container [2022-11-16 11:33:49,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:47" (2/3) ... [2022-11-16 11:33:49,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f248211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:33:49, skipping insertion in model container [2022-11-16 11:33:49,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:33:49" (3/3) ... [2022-11-16 11:33:49,702 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.opt.i [2022-11-16 11:33:49,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:33:49,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-16 11:33:49,723 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:33:49,931 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:33:49,977 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:33:49,999 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-16 11:33:50,004 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-16 11:33:50,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 179 transitions, 373 flow [2022-11-16 11:33:50,171 INFO L130 PetriNetUnfolder]: 2/176 cut-off events. [2022-11-16 11:33:50,172 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:33:50,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 2/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 245 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-16 11:33:50,185 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-16 11:34:05,090 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 203 DAG size of output: 201 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:34:32,646 INFO L134 LiptonReduction]: Checked pairs total: 34452 [2022-11-16 11:34:32,647 INFO L136 LiptonReduction]: Total number of compositions: 159 [2022-11-16 11:34:32,654 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-16 11:34:34,102 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-16 11:34:34,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:34:34,135 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;@5fc42aca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:34:34,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-16 11:34:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-16 11:34:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:34:34,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:34,216 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:34:34,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1141, now seen corresponding path program 1 times [2022-11-16 11:34:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:34,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301619410] [2022-11-16 11:34:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:34,241 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-16 11:34:34,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:34,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:34,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:34,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:34:34,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:34,420 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-16 11:34:34,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:34,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:34,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301619410] [2022-11-16 11:34:34,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301619410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:34,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:34,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:34:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455880186] [2022-11-16 11:34:34,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:34,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:34:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:34:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:34:34,506 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-16 11:34:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:35,426 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-16 11:34:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:34:35,443 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-16 11:34:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:35,836 INFO L225 Difference]: With dead ends: 15204 [2022-11-16 11:34:35,838 INFO L226 Difference]: Without dead ends: 15204 [2022-11-16 11:34:35,839 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-16 11:34:35,842 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:35,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:34:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-16 11:34:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-16 11:34:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 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-16 11:34:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-16 11:34:37,127 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-16 11:34:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:37,128 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-16 11:34:37,128 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-16 11:34:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-16 11:34:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:34:37,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:37,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:34:37,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-16 11:34:37,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:37,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash 34996770, now seen corresponding path program 1 times [2022-11-16 11:34:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:37,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720432839] [2022-11-16 11:34:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:37,346 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-16 11:34:37,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:37,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:37,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:34:37,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:37,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-16 11:34:37,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:37,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720432839] [2022-11-16 11:34:37,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720432839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:37,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:37,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:34:37,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778406520] [2022-11-16 11:34:37,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:37,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:37,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:37,568 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-16 11:34:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:38,261 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-16 11:34:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-16 11:34:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:38,554 INFO L225 Difference]: With dead ends: 13683 [2022-11-16 11:34:38,554 INFO L226 Difference]: Without dead ends: 13683 [2022-11-16 11:34:38,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-16 11:34:38,555 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:38,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:34:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-16 11:34:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-16 11:34:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 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-16 11:34:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-16 11:34:39,563 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-16 11:34:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:39,564 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-16 11:34:39,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-16 11:34:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-16 11:34:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:34:39,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:39,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:34:39,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:39,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:39,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1084900804, now seen corresponding path program 1 times [2022-11-16 11:34:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:39,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245888831] [2022-11-16 11:34:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:39,771 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-16 11:34:39,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:39,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:39,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:40,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:34:40,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:40,087 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-16 11:34:40,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:40,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:40,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245888831] [2022-11-16 11:34:40,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245888831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:40,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:40,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:34:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25224503] [2022-11-16 11:34:40,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:40,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:40,093 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:34:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:40,901 INFO L93 Difference]: Finished difference Result 17556 states and 63266 transitions. [2022-11-16 11:34:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-16 11:34:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:41,018 INFO L225 Difference]: With dead ends: 17556 [2022-11-16 11:34:41,018 INFO L226 Difference]: Without dead ends: 17556 [2022-11-16 11:34:41,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 11:34:41,021 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:41,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:34:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17556 states. [2022-11-16 11:34:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17556 to 14790. [2022-11-16 11:34:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 13280 states have (on average 4.209638554216867) internal successors, (55904), 14789 states have internal predecessors, (55904), 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-16 11:34:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 55904 transitions. [2022-11-16 11:34:41,795 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 55904 transitions. Word has length 5 [2022-11-16 11:34:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:41,796 INFO L495 AbstractCegarLoop]: Abstraction has 14790 states and 55904 transitions. [2022-11-16 11:34:41,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:34:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 55904 transitions. [2022-11-16 11:34:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:34:41,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:41,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:34:41,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:42,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:42,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1084900806, now seen corresponding path program 1 times [2022-11-16 11:34:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:42,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253477217] [2022-11-16 11:34:42,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:42,012 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-16 11:34:42,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:42,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:42,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:34:42,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:42,443 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:34:42,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 11:34:42,497 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-16 11:34:42,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:42,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:42,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253477217] [2022-11-16 11:34:42,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253477217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:42,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:42,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:34:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918815755] [2022-11-16 11:34:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:42,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:42,501 INFO L87 Difference]: Start difference. First operand 14790 states and 55904 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 11:34:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:42,908 INFO L93 Difference]: Finished difference Result 8104 states and 29603 transitions. [2022-11-16 11:34:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-16 11:34:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:42,961 INFO L225 Difference]: With dead ends: 8104 [2022-11-16 11:34:42,961 INFO L226 Difference]: Without dead ends: 8104 [2022-11-16 11:34:42,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 11:34:42,966 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:42,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:34:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2022-11-16 11:34:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 8104. [2022-11-16 11:34:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8104 states, 7579 states have (on average 3.9059242644148306) internal successors, (29603), 8103 states have internal predecessors, (29603), 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-16 11:34:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8104 states to 8104 states and 29603 transitions. [2022-11-16 11:34:43,376 INFO L78 Accepts]: Start accepts. Automaton has 8104 states and 29603 transitions. Word has length 5 [2022-11-16 11:34:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:43,377 INFO L495 AbstractCegarLoop]: Abstraction has 8104 states and 29603 transitions. [2022-11-16 11:34:43,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 11:34:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 8104 states and 29603 transitions. [2022-11-16 11:34:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:34:43,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:43,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:34:43,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:43,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:43,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1084900807, now seen corresponding path program 1 times [2022-11-16 11:34:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:43,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450070164] [2022-11-16 11:34:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:43,592 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-16 11:34:43,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:43,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:43,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:34:43,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:43,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:43,876 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-16 11:34:43,928 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-16 11:34:43,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:43,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450070164] [2022-11-16 11:34:43,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450070164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:43,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:43,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:34:43,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389173308] [2022-11-16 11:34:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:43,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:43,931 INFO L87 Difference]: Start difference. First operand 8104 states and 29603 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 11:34:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:44,116 INFO L93 Difference]: Finished difference Result 2932 states and 10036 transitions. [2022-11-16 11:34:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:44,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-16 11:34:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:44,134 INFO L225 Difference]: With dead ends: 2932 [2022-11-16 11:34:44,135 INFO L226 Difference]: Without dead ends: 2932 [2022-11-16 11:34:44,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 11:34:44,136 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:44,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:34:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2022-11-16 11:34:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2801. [2022-11-16 11:34:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2727 states have (on average 3.523285661899523) internal successors, (9608), 2800 states have internal predecessors, (9608), 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-16 11:34:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 9608 transitions. [2022-11-16 11:34:44,217 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 9608 transitions. Word has length 5 [2022-11-16 11:34:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:44,218 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 9608 transitions. [2022-11-16 11:34:44,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 11:34:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 9608 transitions. [2022-11-16 11:34:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:34:44,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:44,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:44,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:34:44,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:44,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:44,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash -129873834, now seen corresponding path program 1 times [2022-11-16 11:34:44,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:44,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595818348] [2022-11-16 11:34:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:44,433 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-16 11:34:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:44,434 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:44,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:44,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:34:44,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:44,668 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-16 11:34:44,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:44,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:44,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595818348] [2022-11-16 11:34:44,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595818348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:44,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:44,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:34:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694170494] [2022-11-16 11:34:44,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:44,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:44,671 INFO L87 Difference]: Start difference. First operand 2801 states and 9608 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-16 11:34:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:44,875 INFO L93 Difference]: Finished difference Result 1210 states and 3294 transitions. [2022-11-16 11:34:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-16 11:34:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:44,880 INFO L225 Difference]: With dead ends: 1210 [2022-11-16 11:34:44,881 INFO L226 Difference]: Without dead ends: 1210 [2022-11-16 11:34:44,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-16 11:34:44,882 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:44,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:34:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-11-16 11:34:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2022-11-16 11:34:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1160 states have (on average 2.839655172413793) internal successors, (3294), 1209 states have internal predecessors, (3294), 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-16 11:34:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3294 transitions. [2022-11-16 11:34:44,911 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3294 transitions. Word has length 10 [2022-11-16 11:34:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:44,911 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 3294 transitions. [2022-11-16 11:34:44,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-16 11:34:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3294 transitions. [2022-11-16 11:34:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:34:44,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:44,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:44,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:34:45,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:45,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:45,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:45,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1255898866, now seen corresponding path program 1 times [2022-11-16 11:34:45,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:45,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011566216] [2022-11-16 11:34:45,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:45,124 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-16 11:34:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:45,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:45,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:34:45,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:45,463 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-16 11:34:45,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:45,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:45,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011566216] [2022-11-16 11:34:45,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011566216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:45,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:45,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:34:45,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729360990] [2022-11-16 11:34:45,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:45,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:34:45,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:45,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:34:45,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:34:45,471 INFO L87 Difference]: Start difference. First operand 1210 states and 3294 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-16 11:34:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:45,759 INFO L93 Difference]: Finished difference Result 377 states and 828 transitions. [2022-11-16 11:34:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:34:45,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-16 11:34:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:45,761 INFO L225 Difference]: With dead ends: 377 [2022-11-16 11:34:45,761 INFO L226 Difference]: Without dead ends: 377 [2022-11-16 11:34:45,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:34:45,762 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:45,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:34:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-16 11:34:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-16 11:34:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 359 states have (on average 2.3064066852367686) internal successors, (828), 376 states have internal predecessors, (828), 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-16 11:34:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 828 transitions. [2022-11-16 11:34:45,774 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 828 transitions. Word has length 14 [2022-11-16 11:34:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:45,775 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 828 transitions. [2022-11-16 11:34:45,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-16 11:34:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 828 transitions. [2022-11-16 11:34:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:34:45,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:45,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:45,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:45,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:45,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1155221958, now seen corresponding path program 1 times [2022-11-16 11:34:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:45,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670729714] [2022-11-16 11:34:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:45,994 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-16 11:34:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:45,996 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:46,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:46,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:34:46,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:46,298 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-16 11:34:46,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:34:46,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:34:46,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670729714] [2022-11-16 11:34:46,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670729714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:46,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:46,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:34:46,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962328916] [2022-11-16 11:34:46,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:46,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:34:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:34:46,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:34:46,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:34:46,301 INFO L87 Difference]: Start difference. First operand 377 states and 828 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-16 11:34:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:46,713 INFO L93 Difference]: Finished difference Result 226 states and 533 transitions. [2022-11-16 11:34:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:34:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-11-16 11:34:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:46,714 INFO L225 Difference]: With dead ends: 226 [2022-11-16 11:34:46,715 INFO L226 Difference]: Without dead ends: 226 [2022-11-16 11:34:46,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-16 11:34:46,716 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:46,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:34:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-16 11:34:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-11-16 11:34:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 222 states have (on average 2.400900900900901) internal successors, (533), 225 states have internal predecessors, (533), 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-16 11:34:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 533 transitions. [2022-11-16 11:34:46,723 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 533 transitions. Word has length 18 [2022-11-16 11:34:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:46,723 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 533 transitions. [2022-11-16 11:34:46,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-16 11:34:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 533 transitions. [2022-11-16 11:34:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:34:46,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:46,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:46,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:46,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:46,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-16 11:34:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1476977752, now seen corresponding path program 1 times [2022-11-16 11:34:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:34:46,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780944888] [2022-11-16 11:34:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:46,941 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-16 11:34:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:34:46,942 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:46,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d30e2a-ff1c-41ad-a338-9b7d0a113f75/bin/uautomizer-tPACEb0tL8/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-16 11:34:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:47,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:34:47,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:57,448 WARN L233 SmtUtils]: Spent 19.78s on a formula simplification that was a NOOP. DAG size: 817 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)