./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro --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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- 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-8393723 [2022-11-18 20:01:54,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:01:54,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:01:54,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:01:54,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:01:54,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:01:54,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:01:54,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:01:54,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:01:54,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:01:54,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:01:54,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:01:54,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:01:54,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:01:54,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:01:54,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:01:54,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:01:54,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:01:54,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:01:54,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:01:54,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:01:54,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:01:54,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:01:54,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:01:54,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:01:54,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:01:54,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:01:54,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:01:54,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:01:54,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:01:54,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:01:54,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:01:54,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:01:54,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:01:54,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:01:54,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:01:54,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:01:54,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:01:54,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:01:54,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:01:54,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:01:54,961 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:01:55,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:01:55,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:01:55,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:01:55,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:01:55,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:01:55,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:01:55,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:01:55,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:01:55,009 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:01:55,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:01:55,010 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:01:55,010 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:01:55,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:01:55,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:01:55,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:01:55,011 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:01:55,011 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:01:55,012 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:01:55,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:01:55,012 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:01:55,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:01:55,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:01:55,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:01:55,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:01:55,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:01:55,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:55,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:01:55,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:01:55,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:01:55,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:01:55,015 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_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro 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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2022-11-18 20:01:55,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:01:55,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:01:55,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:01:55,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:01:55,363 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:01:55,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 20:01:55,440 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/bf3cc1fb8/c2322329ffa9447bb33804af406d40cc/FLAG151b44ad8 [2022-11-18 20:01:56,104 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:01:56,105 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 20:01:56,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/bf3cc1fb8/c2322329ffa9447bb33804af406d40cc/FLAG151b44ad8 [2022-11-18 20:01:56,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/bf3cc1fb8/c2322329ffa9447bb33804af406d40cc [2022-11-18 20:01:56,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:01:56,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:01:56,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:56,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:01:56,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:01:56,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:56" (1/1) ... [2022-11-18 20:01:56,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b79cb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:56, skipping insertion in model container [2022-11-18 20:01:56,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:56" (1/1) ... [2022-11-18 20:01:56,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:01:56,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:01:56,807 WARN L234 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_6c369cba-053b-485b-89bf-cad4756cf813/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 20:01:57,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:57,182 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:01:57,200 WARN L234 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_6c369cba-053b-485b-89bf-cad4756cf813/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 20:01:57,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:57,339 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:01:57,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57 WrapperNode [2022-11-18 20:01:57,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:57,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:57,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:01:57,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:01:57,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,449 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-18 20:01:57,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:57,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:01:57,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:01:57,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:01:57,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,481 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:01:57,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:01:57,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:01:57,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:01:57,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (1/1) ... [2022-11-18 20:01:57,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:57,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:01:57,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:01:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:01:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:01:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:01:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:01:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:01:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:01:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:01:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:01:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:01:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:01:57,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:01:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 20:01:57,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 20:01:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:01:57,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:01:57,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:01:57,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:01:57,623 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:01:57,851 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:01:57,853 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:01:58,433 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:01:58,674 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:01:58,674 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:01:58,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:58 BoogieIcfgContainer [2022-11-18 20:01:58,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:01:58,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:01:58,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:01:58,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:01:58,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:01:56" (1/3) ... [2022-11-18 20:01:58,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e1bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:58, skipping insertion in model container [2022-11-18 20:01:58,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:57" (2/3) ... [2022-11-18 20:01:58,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e1bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:58, skipping insertion in model container [2022-11-18 20:01:58,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:58" (3/3) ... [2022-11-18 20:01:58,692 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 20:01:58,714 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:01:58,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-18 20:01:58,715 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:01:58,817 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:01:58,875 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:01:58,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-18 20:01:58,896 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-18 20:01:58,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-18 20:01:59,026 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-18 20:01:59,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:01:59,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-18 20:01:59,041 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-18 20:02:06,332 INFO L134 LiptonReduction]: Checked pairs total: 10064 [2022-11-18 20:02:06,332 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-18 20:02:06,342 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-18 20:02:06,755 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-18 20:02:06,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:02:06,792 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;@64134657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:02:06,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-18 20:02:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-18 20:02:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:02:06,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:06,840 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:02:06,842 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 628, now seen corresponding path program 1 times [2022-11-18 20:02:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:06,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536198339] [2022-11-18 20:02:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:07,026 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-18 20:02:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:07,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536198339] [2022-11-18 20:02:07,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536198339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:07,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:07,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:02:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368119424] [2022-11-18 20:02:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:07,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:02:07,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:02:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:02:07,094 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-18 20:02:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:07,299 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-18 20:02:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:02:07,302 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-18 20:02:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:07,383 INFO L225 Difference]: With dead ends: 6074 [2022-11-18 20:02:07,383 INFO L226 Difference]: Without dead ends: 6074 [2022-11-18 20:02:07,384 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-18 20:02:07,387 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:07,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-18 20:02:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-18 20:02:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 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-18 20:02:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-18 20:02:07,907 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-18 20:02:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:07,908 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-18 20:02:07,908 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-18 20:02:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-18 20:02:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:02:07,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:07,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:02:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:02:07,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:07,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash 619955, now seen corresponding path program 1 times [2022-11-18 20:02:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:07,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169007194] [2022-11-18 20:02:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:08,355 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-18 20:02:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169007194] [2022-11-18 20:02:08,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169007194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:08,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:08,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:08,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311986973] [2022-11-18 20:02:08,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:08,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:08,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:08,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:08,429 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:08,639 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-18 20:02:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:08,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 20:02:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:08,685 INFO L225 Difference]: With dead ends: 4962 [2022-11-18 20:02:08,685 INFO L226 Difference]: Without dead ends: 4812 [2022-11-18 20:02:08,685 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-18 20:02:08,687 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:08,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-18 20:02:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-18 20:02:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 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-18 20:02:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-18 20:02:09,101 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-18 20:02:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:09,102 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-18 20:02:09,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-18 20:02:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:02:09,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:09,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:09,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:02:09,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1536648097, now seen corresponding path program 1 times [2022-11-18 20:02:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:09,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424922453] [2022-11-18 20:02:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:10,324 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-18 20:02:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424922453] [2022-11-18 20:02:10,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424922453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:10,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:10,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:10,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934776763] [2022-11-18 20:02:10,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:10,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:02:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:10,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:02:10,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:10,330 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-18 20:02:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:10,714 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2022-11-18 20:02:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:02:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-18 20:02:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:10,769 INFO L225 Difference]: With dead ends: 4062 [2022-11-18 20:02:10,770 INFO L226 Difference]: Without dead ends: 4062 [2022-11-18 20:02:10,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:10,775 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:10,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 40 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:02:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-11-18 20:02:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-11-18 20:02:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 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-18 20:02:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-11-18 20:02:11,025 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 12 [2022-11-18 20:02:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:11,026 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-11-18 20:02:11,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-18 20:02:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-11-18 20:02:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:02:11,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:11,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:11,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:02:11,039 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1536648118, now seen corresponding path program 1 times [2022-11-18 20:02:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:11,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875252791] [2022-11-18 20:02:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:11,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:11,292 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-18 20:02:11,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:11,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875252791] [2022-11-18 20:02:11,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875252791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:11,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:11,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940081594] [2022-11-18 20:02:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:11,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:11,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:11,303 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-18 20:02:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:11,827 INFO L93 Difference]: Finished difference Result 8512 states and 32506 transitions. [2022-11-18 20:02:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:11,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-18 20:02:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:11,958 INFO L225 Difference]: With dead ends: 8512 [2022-11-18 20:02:11,958 INFO L226 Difference]: Without dead ends: 6682 [2022-11-18 20:02:11,958 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-18 20:02:11,960 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:11,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 15 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:02:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2022-11-18 20:02:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 5494. [2022-11-18 20:02:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5494 states, 5493 states have (on average 3.88130347715274) internal successors, (21320), 5493 states have internal predecessors, (21320), 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-18 20:02:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 21320 transitions. [2022-11-18 20:02:12,501 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 21320 transitions. Word has length 12 [2022-11-18 20:02:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:12,502 INFO L495 AbstractCegarLoop]: Abstraction has 5494 states and 21320 transitions. [2022-11-18 20:02:12,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-18 20:02:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 21320 transitions. [2022-11-18 20:02:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:02:12,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:12,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:12,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:02:12,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash -388930093, now seen corresponding path program 1 times [2022-11-18 20:02:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:12,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269478666] [2022-11-18 20:02:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:12,698 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-18 20:02:12,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269478666] [2022-11-18 20:02:12,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269478666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:12,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:12,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:02:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431314330] [2022-11-18 20:02:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:12,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:12,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:12,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:12,702 INFO L87 Difference]: Start difference. First operand 5494 states and 21320 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-18 20:02:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:13,101 INFO L93 Difference]: Finished difference Result 7600 states and 28335 transitions. [2022-11-18 20:02:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:02:13,102 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-18 20:02:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:13,141 INFO L225 Difference]: With dead ends: 7600 [2022-11-18 20:02:13,141 INFO L226 Difference]: Without dead ends: 6402 [2022-11-18 20:02:13,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:02:13,143 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:13,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 19 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:02:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2022-11-18 20:02:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 5382. [2022-11-18 20:02:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5382 states, 5381 states have (on average 3.866195874372793) internal successors, (20804), 5381 states have internal predecessors, (20804), 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-18 20:02:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 20804 transitions. [2022-11-18 20:02:13,483 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 20804 transitions. Word has length 13 [2022-11-18 20:02:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:13,483 INFO L495 AbstractCegarLoop]: Abstraction has 5382 states and 20804 transitions. [2022-11-18 20:02:13,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-18 20:02:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 20804 transitions. [2022-11-18 20:02:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:02:13,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:13,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:13,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:02:13,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash -388691765, now seen corresponding path program 1 times [2022-11-18 20:02:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:13,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384626157] [2022-11-18 20:02:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,757 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-18 20:02:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:13,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384626157] [2022-11-18 20:02:13,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384626157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:13,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:13,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416972760] [2022-11-18 20:02:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:13,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:13,761 INFO L87 Difference]: Start difference. First operand 5382 states and 20804 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-18 20:02:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:14,023 INFO L93 Difference]: Finished difference Result 5908 states and 22373 transitions. [2022-11-18 20:02:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:14,024 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-18 20:02:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:14,060 INFO L225 Difference]: With dead ends: 5908 [2022-11-18 20:02:14,060 INFO L226 Difference]: Without dead ends: 5254 [2022-11-18 20:02:14,061 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-18 20:02:14,061 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:14,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 16 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-11-18 20:02:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5116. [2022-11-18 20:02:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5116 states, 5115 states have (on average 3.8627565982404692) internal successors, (19758), 5115 states have internal predecessors, (19758), 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-18 20:02:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 19758 transitions. [2022-11-18 20:02:14,330 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 19758 transitions. Word has length 13 [2022-11-18 20:02:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:14,330 INFO L495 AbstractCegarLoop]: Abstraction has 5116 states and 19758 transitions. [2022-11-18 20:02:14,331 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-18 20:02:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 19758 transitions. [2022-11-18 20:02:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:02:14,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:14,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:14,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:02:14,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash 830828642, now seen corresponding path program 1 times [2022-11-18 20:02:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:14,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065662040] [2022-11-18 20:02:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,562 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-18 20:02:14,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:14,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065662040] [2022-11-18 20:02:14,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065662040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:14,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:14,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:02:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114131902] [2022-11-18 20:02:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:14,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:14,565 INFO L87 Difference]: Start difference. First operand 5116 states and 19758 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:14,997 INFO L93 Difference]: Finished difference Result 6496 states and 24157 transitions. [2022-11-18 20:02:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:02:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 20:02:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:15,032 INFO L225 Difference]: With dead ends: 6496 [2022-11-18 20:02:15,033 INFO L226 Difference]: Without dead ends: 5516 [2022-11-18 20:02:15,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:02:15,034 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:15,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 24 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:02:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2022-11-18 20:02:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 4256. [2022-11-18 20:02:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4256 states, 4255 states have (on average 3.8378378378378377) internal successors, (16330), 4255 states have internal predecessors, (16330), 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-18 20:02:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4256 states to 4256 states and 16330 transitions. [2022-11-18 20:02:15,290 INFO L78 Accepts]: Start accepts. Automaton has 4256 states and 16330 transitions. Word has length 14 [2022-11-18 20:02:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:15,290 INFO L495 AbstractCegarLoop]: Abstraction has 4256 states and 16330 transitions. [2022-11-18 20:02:15,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4256 states and 16330 transitions. [2022-11-18 20:02:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:02:15,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:15,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:15,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:02:15,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash -44602993, now seen corresponding path program 1 times [2022-11-18 20:02:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:15,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677331070] [2022-11-18 20:02:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:15,538 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-18 20:02:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:15,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677331070] [2022-11-18 20:02:15,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677331070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:15,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:15,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:15,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068447699] [2022-11-18 20:02:15,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:15,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:15,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:15,541 INFO L87 Difference]: Start difference. First operand 4256 states and 16330 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-18 20:02:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:15,656 INFO L93 Difference]: Finished difference Result 3072 states and 10466 transitions. [2022-11-18 20:02:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-18 20:02:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:15,672 INFO L225 Difference]: With dead ends: 3072 [2022-11-18 20:02:15,672 INFO L226 Difference]: Without dead ends: 3072 [2022-11-18 20:02:15,673 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-18 20:02:15,674 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:15,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-11-18 20:02:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2022-11-18 20:02:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 3.4080104200586128) internal successors, (10466), 3071 states have internal predecessors, (10466), 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-18 20:02:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 10466 transitions. [2022-11-18 20:02:15,776 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 10466 transitions. Word has length 15 [2022-11-18 20:02:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:15,777 INFO L495 AbstractCegarLoop]: Abstraction has 3072 states and 10466 transitions. [2022-11-18 20:02:15,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-18 20:02:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 10466 transitions. [2022-11-18 20:02:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:02:15,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:15,787 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-18 20:02:15,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:02:15,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1215314201, now seen corresponding path program 1 times [2022-11-18 20:02:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:15,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424394264] [2022-11-18 20:02:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:15,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:16,056 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-18 20:02:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:16,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424394264] [2022-11-18 20:02:16,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424394264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:16,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:16,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456773915] [2022-11-18 20:02:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:16,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:16,068 INFO L87 Difference]: Start difference. First operand 3072 states and 10466 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-18 20:02:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:16,483 INFO L93 Difference]: Finished difference Result 5555 states and 18264 transitions. [2022-11-18 20:02:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:02:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-18 20:02:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:16,505 INFO L225 Difference]: With dead ends: 5555 [2022-11-18 20:02:16,505 INFO L226 Difference]: Without dead ends: 3863 [2022-11-18 20:02:16,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:02:16,506 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:16,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 19 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:02:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2022-11-18 20:02:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 2801. [2022-11-18 20:02:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2800 states have (on average 3.2985714285714285) internal successors, (9236), 2800 states have internal predecessors, (9236), 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-18 20:02:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 9236 transitions. [2022-11-18 20:02:16,647 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 9236 transitions. Word has length 18 [2022-11-18 20:02:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:16,648 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 9236 transitions. [2022-11-18 20:02:16,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-18 20:02:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 9236 transitions. [2022-11-18 20:02:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:02:16,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:16,655 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-18 20:02:16,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:02:16,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1489803889, now seen corresponding path program 1 times [2022-11-18 20:02:16,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:16,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374877183] [2022-11-18 20:02:16,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:17,019 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-18 20:02:17,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:17,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374877183] [2022-11-18 20:02:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374877183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:17,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:17,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:02:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810736423] [2022-11-18 20:02:17,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:17,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:17,022 INFO L87 Difference]: Start difference. First operand 2801 states and 9236 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-18 20:02:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:17,160 INFO L93 Difference]: Finished difference Result 1713 states and 5046 transitions. [2022-11-18 20:02:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:02:17,161 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-18 20:02:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:17,168 INFO L225 Difference]: With dead ends: 1713 [2022-11-18 20:02:17,168 INFO L226 Difference]: Without dead ends: 1713 [2022-11-18 20:02:17,169 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-18 20:02:17,170 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:17,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 12 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2022-11-18 20:02:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1701. [2022-11-18 20:02:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 2.9458823529411764) internal successors, (5008), 1700 states have internal predecessors, (5008), 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-18 20:02:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 5008 transitions. [2022-11-18 20:02:17,222 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 5008 transitions. Word has length 18 [2022-11-18 20:02:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:17,222 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 5008 transitions. [2022-11-18 20:02:17,223 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-18 20:02:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 5008 transitions. [2022-11-18 20:02:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:02:17,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:17,227 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] [2022-11-18 20:02:17,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:02:17,228 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1192065239, now seen corresponding path program 1 times [2022-11-18 20:02:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:17,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651460432] [2022-11-18 20:02:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:17,541 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-18 20:02:17,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:17,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651460432] [2022-11-18 20:02:17,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651460432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:17,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:17,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097973477] [2022-11-18 20:02:17,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:17,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:17,545 INFO L87 Difference]: Start difference. First operand 1701 states and 5008 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-18 20:02:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:17,821 INFO L93 Difference]: Finished difference Result 2608 states and 7498 transitions. [2022-11-18 20:02:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:17,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2022-11-18 20:02:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:17,827 INFO L225 Difference]: With dead ends: 2608 [2022-11-18 20:02:17,827 INFO L226 Difference]: Without dead ends: 1772 [2022-11-18 20:02:17,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:17,828 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:17,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 17 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-11-18 20:02:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1490. [2022-11-18 20:02:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1489 states have (on average 2.8891873740765615) internal successors, (4302), 1489 states have internal predecessors, (4302), 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-18 20:02:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4302 transitions. [2022-11-18 20:02:17,871 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4302 transitions. Word has length 21 [2022-11-18 20:02:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:17,873 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 4302 transitions. [2022-11-18 20:02:17,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-18 20:02:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4302 transitions. [2022-11-18 20:02:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:02:17,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:17,878 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] [2022-11-18 20:02:17,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:02:17,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1766781745, now seen corresponding path program 2 times [2022-11-18 20:02:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:17,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357155814] [2022-11-18 20:02:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:18,222 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-18 20:02:18,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:18,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357155814] [2022-11-18 20:02:18,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357155814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:18,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:18,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325690825] [2022-11-18 20:02:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:18,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:18,225 INFO L87 Difference]: Start difference. First operand 1490 states and 4302 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-18 20:02:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:18,403 INFO L93 Difference]: Finished difference Result 1128 states and 3264 transitions. [2022-11-18 20:02:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2022-11-18 20:02:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:18,407 INFO L225 Difference]: With dead ends: 1128 [2022-11-18 20:02:18,407 INFO L226 Difference]: Without dead ends: 1078 [2022-11-18 20:02:18,407 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-18 20:02:18,408 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:18,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 16 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-11-18 20:02:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2022-11-18 20:02:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 2.8774373259052926) internal successors, (3099), 1077 states have internal predecessors, (3099), 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-18 20:02:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3099 transitions. [2022-11-18 20:02:18,439 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3099 transitions. Word has length 21 [2022-11-18 20:02:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:18,440 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 3099 transitions. [2022-11-18 20:02:18,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-18 20:02:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3099 transitions. [2022-11-18 20:02:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:02:18,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:18,444 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, 1, 1] [2022-11-18 20:02:18,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:02:18,446 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:18,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1398154984, now seen corresponding path program 1 times [2022-11-18 20:02:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:18,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080624609] [2022-11-18 20:02:18,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:18,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:19,735 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-18 20:02:19,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:19,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080624609] [2022-11-18 20:02:19,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080624609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:19,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:19,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:02:19,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204133032] [2022-11-18 20:02:19,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:19,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:02:19,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:19,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:02:19,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:02:19,737 INFO L87 Difference]: Start difference. First operand 1078 states and 3099 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-18 20:02:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:20,337 INFO L93 Difference]: Finished difference Result 1931 states and 5321 transitions. [2022-11-18 20:02:20,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:02:20,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2022-11-18 20:02:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:20,343 INFO L225 Difference]: With dead ends: 1931 [2022-11-18 20:02:20,343 INFO L226 Difference]: Without dead ends: 1654 [2022-11-18 20:02:20,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:02:20,344 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 77 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:20,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 68 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-11-18 20:02:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1316. [2022-11-18 20:02:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 2.825855513307985) internal successors, (3716), 1315 states have internal predecessors, (3716), 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-18 20:02:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 3716 transitions. [2022-11-18 20:02:20,385 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 3716 transitions. Word has length 25 [2022-11-18 20:02:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:20,385 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 3716 transitions. [2022-11-18 20:02:20,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-18 20:02:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 3716 transitions. [2022-11-18 20:02:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:02:20,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:20,390 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, 1, 1] [2022-11-18 20:02:20,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:02:20,390 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash 336152334, now seen corresponding path program 2 times [2022-11-18 20:02:20,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:20,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170763135] [2022-11-18 20:02:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:21,499 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-18 20:02:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:21,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170763135] [2022-11-18 20:02:21,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170763135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:21,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:21,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:02:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930692120] [2022-11-18 20:02:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:21,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:02:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:02:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:02:21,502 INFO L87 Difference]: Start difference. First operand 1316 states and 3716 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-18 20:02:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:22,103 INFO L93 Difference]: Finished difference Result 1736 states and 4854 transitions. [2022-11-18 20:02:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:02:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2022-11-18 20:02:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:22,109 INFO L225 Difference]: With dead ends: 1736 [2022-11-18 20:02:22,109 INFO L226 Difference]: Without dead ends: 1585 [2022-11-18 20:02:22,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:02:22,110 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 109 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:22,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 43 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2022-11-18 20:02:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1236. [2022-11-18 20:02:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 2.82753036437247) internal successors, (3492), 1235 states have internal predecessors, (3492), 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-18 20:02:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 3492 transitions. [2022-11-18 20:02:22,146 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 3492 transitions. Word has length 25 [2022-11-18 20:02:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:22,146 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 3492 transitions. [2022-11-18 20:02:22,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-18 20:02:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 3492 transitions. [2022-11-18 20:02:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:02:22,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:22,153 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, 1, 1] [2022-11-18 20:02:22,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:02:22,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2137811924, now seen corresponding path program 3 times [2022-11-18 20:02:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:22,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665796720] [2022-11-18 20:02:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:22,620 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-18 20:02:22,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:22,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665796720] [2022-11-18 20:02:22,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665796720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:22,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:22,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:02:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811326573] [2022-11-18 20:02:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:22,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:02:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:02:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:22,623 INFO L87 Difference]: Start difference. First operand 1236 states and 3492 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-18 20:02:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:22,839 INFO L93 Difference]: Finished difference Result 1168 states and 3361 transitions. [2022-11-18 20:02:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:02:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2022-11-18 20:02:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:22,842 INFO L225 Difference]: With dead ends: 1168 [2022-11-18 20:02:22,843 INFO L226 Difference]: Without dead ends: 608 [2022-11-18 20:02:22,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:22,844 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 89 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:22,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 14 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-18 20:02:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2022-11-18 20:02:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 2.8484349258649093) internal successors, (1729), 607 states have internal predecessors, (1729), 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-18 20:02:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1729 transitions. [2022-11-18 20:02:22,867 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1729 transitions. Word has length 25 [2022-11-18 20:02:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:22,867 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 1729 transitions. [2022-11-18 20:02:22,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-18 20:02:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1729 transitions. [2022-11-18 20:02:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:22,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:22,871 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:02:22,871 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash 381480525, now seen corresponding path program 1 times [2022-11-18 20:02:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:22,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110284340] [2022-11-18 20:02:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:24,624 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-18 20:02:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110284340] [2022-11-18 20:02:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110284340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:24,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:24,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:02:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946316623] [2022-11-18 20:02:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:24,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:02:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:02:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:02:24,628 INFO L87 Difference]: Start difference. First operand 608 states and 1729 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-18 20:02:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:25,273 INFO L93 Difference]: Finished difference Result 915 states and 2566 transitions. [2022-11-18 20:02:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:02:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-11-18 20:02:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:25,276 INFO L225 Difference]: With dead ends: 915 [2022-11-18 20:02:25,276 INFO L226 Difference]: Without dead ends: 728 [2022-11-18 20:02:25,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:02:25,281 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:25,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 44 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-18 20:02:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 556. [2022-11-18 20:02:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 2.8162162162162163) internal successors, (1563), 555 states have internal predecessors, (1563), 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-18 20:02:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1563 transitions. [2022-11-18 20:02:25,303 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1563 transitions. Word has length 29 [2022-11-18 20:02:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:25,304 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 1563 transitions. [2022-11-18 20:02:25,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-18 20:02:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1563 transitions. [2022-11-18 20:02:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:25,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:25,307 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:25,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:02:25,308 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 894805653, now seen corresponding path program 2 times [2022-11-18 20:02:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:25,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787486273] [2022-11-18 20:02:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:02:25,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:02:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:02:25,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:02:25,578 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:02:25,580 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-18 20:02:25,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-18 20:02:25,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-18 20:02:25,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-18 20:02:25,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-18 20:02:25,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-18 20:02:25,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-18 20:02:25,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-18 20:02:25,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-18 20:02:25,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-18 20:02:25,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-18 20:02:25,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-18 20:02:25,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-18 20:02:25,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-18 20:02:25,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-18 20:02:25,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-18 20:02:25,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:02:25,590 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:25,597 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:02:25,598 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:02:25,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:02:25 BasicIcfg [2022-11-18 20:02:25,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:02:25,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:02:25,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:02:25,760 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:02:25,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:58" (3/4) ... [2022-11-18 20:02:25,764 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:02:25,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:02:25,765 INFO L158 Benchmark]: Toolchain (without parser) took 29390.20ms. Allocated memory was 119.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 77.9MB in the beginning and 868.4MB in the end (delta: -790.5MB). Peak memory consumption was 580.5MB. Max. memory is 16.1GB. [2022-11-18 20:02:25,766 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 119.5MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:02:25,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 955.06ms. Allocated memory is still 119.5MB. Free memory was 77.8MB in the beginning and 79.0MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:02:25,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.75ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:02:25,767 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 119.5MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:02:25,768 INFO L158 Benchmark]: RCFGBuilder took 1190.45ms. Allocated memory was 119.5MB in the beginning and 165.7MB in the end (delta: 46.1MB). Free memory was 74.8MB in the beginning and 132.7MB in the end (delta: -57.9MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2022-11-18 20:02:25,768 INFO L158 Benchmark]: TraceAbstraction took 27076.65ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 131.7MB in the beginning and 868.4MB in the end (delta: -736.8MB). Peak memory consumption was 589.7MB. Max. memory is 16.1GB. [2022-11-18 20:02:25,768 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 1.5GB. Free memory is still 868.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:02:25,771 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.33ms. Allocated memory is still 119.5MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 955.06ms. Allocated memory is still 119.5MB. Free memory was 77.8MB in the beginning and 79.0MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.75ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 119.5MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1190.45ms. Allocated memory was 119.5MB in the beginning and 165.7MB in the end (delta: 46.1MB). Free memory was 74.8MB in the beginning and 132.7MB in the end (delta: -57.9MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27076.65ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 131.7MB in the beginning and 868.4MB in the end (delta: -736.8MB). Peak memory consumption was 589.7MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 1.5GB. Free memory is still 868.4MB. 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: 7.4s, 160 PlacesBefore, 57 PlacesAfterwards, 149 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 6 FixpointIterations, 56 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 10064 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6002, independent: 5802, independent conditional: 0, independent unconditional: 5802, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2839, independent: 2780, independent conditional: 0, independent unconditional: 2780, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2839, independent: 2752, independent conditional: 0, independent unconditional: 2752, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 504, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 444, dependent conditional: 0, dependent unconditional: 444, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6002, independent: 3022, independent conditional: 0, independent unconditional: 3022, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 2839, unknown conditional: 0, unknown unconditional: 2839] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 357, Positive conditional cache size: 0, Positive unconditional cache size: 357, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L736] 0 _Bool a$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L712] 0 int __unbuffered_p0_EAX = 0; [L720] 0 int a$mem_tmp; [L731] 0 _Bool a$read_delayed; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$r_buff1_thd1; [L733] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L735] 0 int a$w_buff1; [L719] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L732] 0 int *a$read_delayed_var; [L738] 0 _Bool main$tmp_guard1; [L737] 0 _Bool main$tmp_guard0; [L734] 0 _Bool a$w_buff0_used; [L722] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd0; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd4; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t769, ((void *)0), P0, ((void *)0))=-2, t769={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t770, ((void *)0), P1, ((void *)0))=-1, t769={5:0}, t770={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t771; [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t771, ((void *)0), P2, ((void *)0))=0, t769={5:0}, t770={6:0}, t771={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t772, ((void *)0), P3, ((void *)0))=1, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=2, z=0] [L803] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=2, z=1] [L820] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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$$choice2=0, x=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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$$choice2=0, x=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=56, weak$$choice2=255, x=1, y=2, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=56, weak$$choice2=255, x=1, y=2, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=56, weak$$choice2=255, x=1, y=2, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, 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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 871]: 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: 867]: 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 9 procedures, 186 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 367 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2552 IncrementalHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 121 mSDtfsCounter, 2552 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 5821 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 2660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-18 20:02:25,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro --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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- 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-8393723 [2022-11-18 20:02:28,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:02:28,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:02:28,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:02:28,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:02:28,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:02:28,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:02:28,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:02:28,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:02:28,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:02:28,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:02:28,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:02:28,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:02:28,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:02:28,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:02:28,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:02:28,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:02:28,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:02:28,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:02:28,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:02:28,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:02:28,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:02:28,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:02:28,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:02:28,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:02:28,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:02:28,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:02:28,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:02:28,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:02:28,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:02:28,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:02:28,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:02:28,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:02:28,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:02:28,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:02:28,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:02:28,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:02:28,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:02:28,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:02:28,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:02:28,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:02:28,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 20:02:28,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:02:28,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:02:28,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:02:28,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:02:28,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:02:28,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:02:28,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:02:28,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:02:28,665 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:02:28,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:02:28,667 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:02:28,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:02:28,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:02:28,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:02:28,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:02:28,668 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:02:28,669 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:02:28,669 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:02:28,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:02:28,669 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:02:28,670 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:02:28,670 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:02:28,670 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:02:28,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:02:28,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:02:28,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:02:28,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:02:28,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:02:28,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:02:28,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:02:28,673 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:02:28,673 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:02:28,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:02:28,674 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_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro 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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2022-11-18 20:02:29,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:02:29,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:02:29,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:02:29,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:02:29,173 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:02:29,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 20:02:29,267 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/29a98d957/e721c1e1875c4ff78500eda4988051ac/FLAGf8cca12d0 [2022-11-18 20:02:30,079 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:02:30,080 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 20:02:30,111 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/29a98d957/e721c1e1875c4ff78500eda4988051ac/FLAGf8cca12d0 [2022-11-18 20:02:30,257 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/data/29a98d957/e721c1e1875c4ff78500eda4988051ac [2022-11-18 20:02:30,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:02:30,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:02:30,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:02:30,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:02:30,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:02:30,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:02:30" (1/1) ... [2022-11-18 20:02:30,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35baab57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:30, skipping insertion in model container [2022-11-18 20:02:30,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:02:30" (1/1) ... [2022-11-18 20:02:30,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:02:30,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:02:30,537 WARN L234 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_6c369cba-053b-485b-89bf-cad4756cf813/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 20:02:30,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:02:30,934 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:02:30,957 WARN L234 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_6c369cba-053b-485b-89bf-cad4756cf813/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 20:02:31,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:02:31,126 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:02:31,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31 WrapperNode [2022-11-18 20:02:31,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:02:31,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:02:31,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:02:31,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:02:31,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,196 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-18 20:02:31,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:02:31,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:02:31,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:02:31,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:02:31,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,239 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:02:31,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:02:31,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:02:31,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:02:31,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (1/1) ... [2022-11-18 20:02:31,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:02:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:31,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:02:31,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:02:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:02:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:02:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:02:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:02:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:02:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:02:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:02:31,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:02:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:02:31,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:02:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:02:31,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:02:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 20:02:31,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 20:02:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:02:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:02:31,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:02:31,380 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:02:31,666 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:02:31,669 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:02:32,240 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:02:32,517 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:02:32,518 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:02:32,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:02:32 BoogieIcfgContainer [2022-11-18 20:02:32,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:02:32,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:02:32,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:02:32,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:02:32,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:02:30" (1/3) ... [2022-11-18 20:02:32,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c57754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:02:32, skipping insertion in model container [2022-11-18 20:02:32,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:31" (2/3) ... [2022-11-18 20:02:32,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c57754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:02:32, skipping insertion in model container [2022-11-18 20:02:32,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:02:32" (3/3) ... [2022-11-18 20:02:32,537 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 20:02:32,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:02:32,568 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-18 20:02:32,568 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:02:32,717 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:02:32,775 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:02:32,799 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-18 20:02:32,805 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-18 20:02:32,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-18 20:02:32,915 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-18 20:02:32,915 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:02:32,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-18 20:02:32,939 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-18 20:02:43,862 INFO L134 LiptonReduction]: Checked pairs total: 10914 [2022-11-18 20:02:43,863 INFO L136 LiptonReduction]: Total number of compositions: 138 [2022-11-18 20:02:43,873 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-18 20:02:44,343 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-18 20:02:44,420 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:02:44,430 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;@28f86c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:02:44,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-18 20:02:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-18 20:02:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:02:44,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:44,465 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:02:44,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 623, now seen corresponding path program 1 times [2022-11-18 20:02:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:44,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935146353] [2022-11-18 20:02:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:02:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:44,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:44,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:44,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:02:44,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:44,641 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-18 20:02:44,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:44,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:44,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935146353] [2022-11-18 20:02:44,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935146353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:44,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:44,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:02:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934810085] [2022-11-18 20:02:44,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:44,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:02:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:02:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:02:44,701 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-18 20:02:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:45,321 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-18 20:02:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:02:45,325 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-18 20:02:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:45,430 INFO L225 Difference]: With dead ends: 6074 [2022-11-18 20:02:45,430 INFO L226 Difference]: Without dead ends: 6074 [2022-11-18 20:02:45,431 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-18 20:02:45,439 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:45,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-18 20:02:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-18 20:02:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 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-18 20:02:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-18 20:02:46,097 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-18 20:02:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:46,098 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-18 20:02:46,100 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-18 20:02:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-18 20:02:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:02:46,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:46,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:02:46,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:46,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:46,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 614252, now seen corresponding path program 1 times [2022-11-18 20:02:46,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:46,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148904210] [2022-11-18 20:02:46,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:46,320 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-18 20:02:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:46,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:46,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:46,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:02:46,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:46,574 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-18 20:02:46,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:46,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:46,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148904210] [2022-11-18 20:02:46,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148904210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:46,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:46,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175496091] [2022-11-18 20:02:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:46,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:46,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:46,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:46,588 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:46,926 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-18 20:02:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 20:02:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:46,982 INFO L225 Difference]: With dead ends: 4962 [2022-11-18 20:02:46,982 INFO L226 Difference]: Without dead ends: 4812 [2022-11-18 20:02:46,983 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-18 20:02:46,985 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:46,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-18 20:02:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-18 20:02:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 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-18 20:02:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-18 20:02:47,468 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-18 20:02:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:47,469 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-18 20:02:47,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-18 20:02:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:02:47,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:47,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:47,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:47,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:47,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1774812163, now seen corresponding path program 1 times [2022-11-18 20:02:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:47,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947643872] [2022-11-18 20:02:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:47,690 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-18 20:02:47,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:47,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:47,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:02:47,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:47,937 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-18 20:02:47,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:47,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:47,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947643872] [2022-11-18 20:02:47,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947643872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:47,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:47,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:47,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618612437] [2022-11-18 20:02:47,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:47,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:47,942 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:48,144 INFO L93 Difference]: Finished difference Result 3212 states and 11300 transitions. [2022-11-18 20:02:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:48,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-18 20:02:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:48,179 INFO L225 Difference]: With dead ends: 3212 [2022-11-18 20:02:48,179 INFO L226 Difference]: Without dead ends: 3212 [2022-11-18 20:02:48,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-18 20:02:48,181 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:48,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-11-18 20:02:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2022-11-18 20:02:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3210 states have (on average 3.520249221183801) internal successors, (11300), 3211 states have internal predecessors, (11300), 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-18 20:02:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 11300 transitions. [2022-11-18 20:02:48,444 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 11300 transitions. Word has length 12 [2022-11-18 20:02:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:48,446 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 11300 transitions. [2022-11-18 20:02:48,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 11300 transitions. [2022-11-18 20:02:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:02:48,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:48,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:48,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:48,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:48,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:48,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 137769074, now seen corresponding path program 1 times [2022-11-18 20:02:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177103021] [2022-11-18 20:02:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:48,668 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-18 20:02:48,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:48,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:48,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:48,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:02:48,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:48,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-18 20:02:48,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:48,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:48,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177103021] [2022-11-18 20:02:48,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177103021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:48,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:48,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:02:48,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522767868] [2022-11-18 20:02:48,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:48,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:48,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:48,933 INFO L87 Difference]: Start difference. First operand 3212 states and 11300 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-18 20:02:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:49,202 INFO L93 Difference]: Finished difference Result 1692 states and 5220 transitions. [2022-11-18 20:02:49,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:02:49,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-18 20:02:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:49,212 INFO L225 Difference]: With dead ends: 1692 [2022-11-18 20:02:49,212 INFO L226 Difference]: Without dead ends: 1692 [2022-11-18 20:02:49,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-18 20:02:49,214 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:49,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-11-18 20:02:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2022-11-18 20:02:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 3.088757396449704) internal successors, (5220), 1691 states have internal predecessors, (5220), 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-18 20:02:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5220 transitions. [2022-11-18 20:02:49,279 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5220 transitions. Word has length 16 [2022-11-18 20:02:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:49,281 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5220 transitions. [2022-11-18 20:02:49,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-18 20:02:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5220 transitions. [2022-11-18 20:02:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:02:49,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:49,287 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-18 20:02:49,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:49,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:49,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1083765700, now seen corresponding path program 1 times [2022-11-18 20:02:49,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:49,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642173355] [2022-11-18 20:02:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:49,510 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-18 20:02:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:49,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:49,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:49,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:02:49,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:49,790 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-18 20:02:49,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:49,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:49,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642173355] [2022-11-18 20:02:49,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642173355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:49,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:49,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815092779] [2022-11-18 20:02:49,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:49,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:49,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:49,794 INFO L87 Difference]: Start difference. First operand 1692 states and 5220 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-18 20:02:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:50,169 INFO L93 Difference]: Finished difference Result 1152 states and 3600 transitions. [2022-11-18 20:02:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:50,170 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-18 20:02:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:50,214 INFO L225 Difference]: With dead ends: 1152 [2022-11-18 20:02:50,214 INFO L226 Difference]: Without dead ends: 1152 [2022-11-18 20:02:50,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-18 20:02:50,215 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:50,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 36 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:02:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-18 20:02:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-18 20:02:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.130434782608696) internal successors, (3600), 1151 states have internal predecessors, (3600), 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-18 20:02:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3600 transitions. [2022-11-18 20:02:50,271 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3600 transitions. Word has length 20 [2022-11-18 20:02:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:50,272 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3600 transitions. [2022-11-18 20:02:50,272 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-18 20:02:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3600 transitions. [2022-11-18 20:02:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:02:50,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:50,278 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, 1] [2022-11-18 20:02:50,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:50,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:50,493 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1218146636, now seen corresponding path program 1 times [2022-11-18 20:02:50,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:50,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804359446] [2022-11-18 20:02:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:50,497 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-18 20:02:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:50,499 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:50,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:50,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:02:50,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:50,817 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-18 20:02:50,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:50,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:50,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804359446] [2022-11-18 20:02:50,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804359446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:50,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:50,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:02:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314796726] [2022-11-18 20:02:50,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:50,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:02:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:50,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:02:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:50,822 INFO L87 Difference]: Start difference. First operand 1152 states and 3600 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-18 20:02:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:51,333 INFO L93 Difference]: Finished difference Result 1067 states and 3430 transitions. [2022-11-18 20:02:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:02:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2022-11-18 20:02:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:51,341 INFO L225 Difference]: With dead ends: 1067 [2022-11-18 20:02:51,341 INFO L226 Difference]: Without dead ends: 1067 [2022-11-18 20:02:51,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:51,345 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:51,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-18 20:02:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2022-11-18 20:02:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 3.220657276995305) internal successors, (3430), 1066 states have internal predecessors, (3430), 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-18 20:02:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3430 transitions. [2022-11-18 20:02:51,398 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3430 transitions. Word has length 24 [2022-11-18 20:02:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:51,399 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3430 transitions. [2022-11-18 20:02:51,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-18 20:02:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3430 transitions. [2022-11-18 20:02:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:51,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:51,405 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:51,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:51,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:51,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -94033686, now seen corresponding path program 1 times [2022-11-18 20:02:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:51,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276890823] [2022-11-18 20:02:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:51,622 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-18 20:02:51,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:51,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:51,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:51,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:02:51,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:52,903 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-18 20:02:52,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:52,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:52,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276890823] [2022-11-18 20:02:52,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276890823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:52,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:52,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197646357] [2022-11-18 20:02:52,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:52,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:02:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:52,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:02:52,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:52,905 INFO L87 Difference]: Start difference. First operand 1067 states and 3430 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-18 20:02:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:53,149 INFO L93 Difference]: Finished difference Result 1910 states and 6156 transitions. [2022-11-18 20:02:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:02:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-11-18 20:02:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:53,160 INFO L225 Difference]: With dead ends: 1910 [2022-11-18 20:02:53,160 INFO L226 Difference]: Without dead ends: 1910 [2022-11-18 20:02:53,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:53,162 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:53,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 41 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-11-18 20:02:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2022-11-18 20:02:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1350. [2022-11-18 20:02:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1348 states have (on average 3.1513353115727) internal successors, (4248), 1349 states have internal predecessors, (4248), 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-18 20:02:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 4248 transitions. [2022-11-18 20:02:53,227 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 4248 transitions. Word has length 29 [2022-11-18 20:02:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:53,228 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 4248 transitions. [2022-11-18 20:02:53,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-18 20:02:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 4248 transitions. [2022-11-18 20:02:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:53,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:53,236 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:53,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:53,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:53,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash -94033715, now seen corresponding path program 1 times [2022-11-18 20:02:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:53,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604322035] [2022-11-18 20:02:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:53,453 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-18 20:02:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:53,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:53,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:53,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:02:53,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:53,729 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-18 20:02:53,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:53,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:53,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604322035] [2022-11-18 20:02:53,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604322035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:53,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:53,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735862655] [2022-11-18 20:02:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:53,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:53,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:53,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:53,734 INFO L87 Difference]: Start difference. First operand 1350 states and 4248 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-18 20:02:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:54,063 INFO L93 Difference]: Finished difference Result 2141 states and 6611 transitions. [2022-11-18 20:02:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-11-18 20:02:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:54,073 INFO L225 Difference]: With dead ends: 2141 [2022-11-18 20:02:54,074 INFO L226 Difference]: Without dead ends: 1802 [2022-11-18 20:02:54,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:02:54,075 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:54,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 25 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:02:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-11-18 20:02:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1801. [2022-11-18 20:02:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 3.1172873818788216) internal successors, (5608), 1800 states have internal predecessors, (5608), 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-18 20:02:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 5608 transitions. [2022-11-18 20:02:54,145 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 5608 transitions. Word has length 29 [2022-11-18 20:02:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:54,148 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 5608 transitions. [2022-11-18 20:02:54,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-18 20:02:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 5608 transitions. [2022-11-18 20:02:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:54,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:54,156 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:54,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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)] Ended with exit code 0 [2022-11-18 20:02:54,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:54,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1850338348, now seen corresponding path program 2 times [2022-11-18 20:02:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:54,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800381085] [2022-11-18 20:02:54,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:02:54,373 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-18 20:02:54,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:54,374 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:54,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:54,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:02:54,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:02:54,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:02:54,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:55,542 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-18 20:02:55,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:55,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:55,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800381085] [2022-11-18 20:02:55,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800381085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:55,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:55,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523259628] [2022-11-18 20:02:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:55,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:02:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:55,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:02:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:55,545 INFO L87 Difference]: Start difference. First operand 1801 states and 5608 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-18 20:02:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:55,794 INFO L93 Difference]: Finished difference Result 3067 states and 9628 transitions. [2022-11-18 20:02:55,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:02:55,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-11-18 20:02:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:55,810 INFO L225 Difference]: With dead ends: 3067 [2022-11-18 20:02:55,810 INFO L226 Difference]: Without dead ends: 2448 [2022-11-18 20:02:55,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:55,811 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:55,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2022-11-18 20:02:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-11-18 20:02:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1885. [2022-11-18 20:02:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1883 states have (on average 3.1290493892724376) internal successors, (5892), 1884 states have internal predecessors, (5892), 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-18 20:02:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 5892 transitions. [2022-11-18 20:02:55,905 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 5892 transitions. Word has length 29 [2022-11-18 20:02:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:55,906 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 5892 transitions. [2022-11-18 20:02:55,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-18 20:02:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 5892 transitions. [2022-11-18 20:02:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:55,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:55,915 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:55,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:56,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:56,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1817142893, now seen corresponding path program 2 times [2022-11-18 20:02:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:56,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105103429] [2022-11-18 20:02:56,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:02:56,131 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-18 20:02:56,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:56,133 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:56,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (11)] Waiting until timeout for monitored process [2022-11-18 20:02:56,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:02:56,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:02:56,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:02:56,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:56,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-18 20:02:56,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:56,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:56,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105103429] [2022-11-18 20:02:56,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105103429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:56,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:56,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:02:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095707339] [2022-11-18 20:02:56,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:56,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:02:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:56,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:02:56,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:02:56,672 INFO L87 Difference]: Start difference. First operand 1885 states and 5892 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-18 20:02:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:57,247 INFO L93 Difference]: Finished difference Result 3067 states and 9252 transitions. [2022-11-18 20:02:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:02:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2022-11-18 20:02:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:57,265 INFO L225 Difference]: With dead ends: 3067 [2022-11-18 20:02:57,265 INFO L226 Difference]: Without dead ends: 2920 [2022-11-18 20:02:57,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:02:57,266 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:57,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 52 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2022-11-18 20:02:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2063. [2022-11-18 20:02:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 2061 states have (on average 3.1203299369238233) internal successors, (6431), 2062 states have internal predecessors, (6431), 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-18 20:02:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 6431 transitions. [2022-11-18 20:02:57,362 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 6431 transitions. Word has length 29 [2022-11-18 20:02:57,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:57,362 INFO L495 AbstractCegarLoop]: Abstraction has 2063 states and 6431 transitions. [2022-11-18 20:02:57,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-18 20:02:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 6431 transitions. [2022-11-18 20:02:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:57,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:57,370 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:57,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (11)] Ended with exit code 0 [2022-11-18 20:02:57,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:57,585 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1489794229, now seen corresponding path program 3 times [2022-11-18 20:02:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:57,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303127153] [2022-11-18 20:02:57,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:02:57,588 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-18 20:02:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:57,589 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:57,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (12)] Waiting until timeout for monitored process [2022-11-18 20:02:57,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 20:02:57,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:02:57,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:02:57,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:58,239 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-18 20:02:58,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:58,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:58,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303127153] [2022-11-18 20:02:58,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303127153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:58,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:58,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:02:58,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762427614] [2022-11-18 20:02:58,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:58,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:02:58,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:58,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:02:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:02:58,243 INFO L87 Difference]: Start difference. First operand 2063 states and 6431 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-18 20:02:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:58,840 INFO L93 Difference]: Finished difference Result 2927 states and 8698 transitions. [2022-11-18 20:02:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:02:58,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2022-11-18 20:02:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:58,853 INFO L225 Difference]: With dead ends: 2927 [2022-11-18 20:02:58,853 INFO L226 Difference]: Without dead ends: 2759 [2022-11-18 20:02:58,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:02:58,855 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:58,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 51 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2022-11-18 20:02:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2027. [2022-11-18 20:02:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2025 states have (on average 3.0987654320987654) internal successors, (6275), 2026 states have internal predecessors, (6275), 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-18 20:02:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 6275 transitions. [2022-11-18 20:02:58,938 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 6275 transitions. Word has length 29 [2022-11-18 20:02:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:58,939 INFO L495 AbstractCegarLoop]: Abstraction has 2027 states and 6275 transitions. [2022-11-18 20:02:58,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-18 20:02:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 6275 transitions. [2022-11-18 20:02:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:58,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:58,946 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:58,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:59,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:59,161 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1827424389, now seen corresponding path program 4 times [2022-11-18 20:02:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:59,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136259163] [2022-11-18 20:02:59,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:02:59,163 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-18 20:02:59,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:59,165 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:59,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (13)] Waiting until timeout for monitored process [2022-11-18 20:02:59,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:02:59,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:02:59,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:02:59,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:59,432 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-18 20:02:59,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:59,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:02:59,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136259163] [2022-11-18 20:02:59,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136259163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:59,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:59,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:02:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712562418] [2022-11-18 20:02:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:59,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:02:59,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:59,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:59,437 INFO L87 Difference]: Start difference. First operand 2027 states and 6275 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-18 20:02:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:59,655 INFO L93 Difference]: Finished difference Result 2822 states and 8621 transitions. [2022-11-18 20:02:59,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:02:59,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2022-11-18 20:02:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:59,671 INFO L225 Difference]: With dead ends: 2822 [2022-11-18 20:02:59,671 INFO L226 Difference]: Without dead ends: 2519 [2022-11-18 20:02:59,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-18 20:02:59,672 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:59,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-11-18 20:02:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1824. [2022-11-18 20:02:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 3.088364434687157) internal successors, (5627), 1823 states have internal predecessors, (5627), 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-18 20:02:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 5627 transitions. [2022-11-18 20:02:59,751 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 5627 transitions. Word has length 29 [2022-11-18 20:02:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:59,752 INFO L495 AbstractCegarLoop]: Abstraction has 1824 states and 5627 transitions. [2022-11-18 20:02:59,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-18 20:02:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 5627 transitions. [2022-11-18 20:02:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:02:59,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:59,760 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:59,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:59,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:02:59,975 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:02:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1501596933, now seen corresponding path program 5 times [2022-11-18 20:02:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:02:59,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905969368] [2022-11-18 20:02:59,977 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:02:59,977 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-18 20:02:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:02:59,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:03:00,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (14)] Waiting until timeout for monitored process [2022-11-18 20:03:00,182 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:03:00,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:03:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:03:00,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:00,841 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-18 20:03:00,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:00,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:00,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905969368] [2022-11-18 20:03:00,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905969368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:00,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:00,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:03:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950637490] [2022-11-18 20:03:00,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:00,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:03:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:00,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:03:00,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:03:00,843 INFO L87 Difference]: Start difference. First operand 1824 states and 5627 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-18 20:03:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:01,457 INFO L93 Difference]: Finished difference Result 2092 states and 6317 transitions. [2022-11-18 20:03:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:03:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-11-18 20:03:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:01,467 INFO L225 Difference]: With dead ends: 2092 [2022-11-18 20:03:01,468 INFO L226 Difference]: Without dead ends: 1857 [2022-11-18 20:03:01,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:03:01,470 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:01,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 56 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:03:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2022-11-18 20:03:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1396. [2022-11-18 20:03:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1394 states have (on average 3.07532281205165) internal successors, (4287), 1395 states have internal predecessors, (4287), 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-18 20:03:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 4287 transitions. [2022-11-18 20:03:01,522 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 4287 transitions. Word has length 29 [2022-11-18 20:03:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:01,523 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 4287 transitions. [2022-11-18 20:03:01,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-18 20:03:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 4287 transitions. [2022-11-18 20:03:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:03:01,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:01,528 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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:01,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:01,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:03:01,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:03:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash -985782041, now seen corresponding path program 6 times [2022-11-18 20:03:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:01,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073397317] [2022-11-18 20:03:01,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:03:01,744 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-18 20:03:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:01,746 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:03:01,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (15)] Waiting until timeout for monitored process [2022-11-18 20:03:01,981 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-18 20:03:01,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:03:01,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:03:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:03:02,189 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 20:03:02,189 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:03:02,191 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-18 20:03:02,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-18 20:03:02,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-18 20:03:02,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-18 20:03:02,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-18 20:03:02,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-18 20:03:02,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-18 20:03:02,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-18 20:03:02,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-18 20:03:02,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-18 20:03:02,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-18 20:03:02,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-18 20:03:02,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-18 20:03:02,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-18 20:03:02,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-18 20:03:02,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-18 20:03:02,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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 (15)] Ended with exit code 0 [2022-11-18 20:03:02,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/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-18 20:03:02,437 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:02,444 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:03:02,444 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:03:02,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:03:02 BasicIcfg [2022-11-18 20:03:02,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:03:02,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:03:02,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:03:02,615 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:03:02,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:02:32" (3/4) ... [2022-11-18 20:03:02,619 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:03:02,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:03:02,620 INFO L158 Benchmark]: Toolchain (without parser) took 32358.60ms. Allocated memory was 69.2MB in the beginning and 599.8MB in the end (delta: 530.6MB). Free memory was 48.7MB in the beginning and 137.1MB in the end (delta: -88.4MB). Peak memory consumption was 440.7MB. Max. memory is 16.1GB. [2022-11-18 20:03:02,624 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 69.2MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:03:02,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.09ms. Allocated memory is still 69.2MB. Free memory was 48.5MB in the beginning and 39.6MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:03:02,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.81ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 37.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:03:02,626 INFO L158 Benchmark]: Boogie Preprocessor took 49.81ms. Allocated memory is still 69.2MB. Free memory was 37.0MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:02,626 INFO L158 Benchmark]: RCFGBuilder took 1275.50ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 34.7MB in the beginning and 48.5MB in the end (delta: -13.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-11-18 20:03:02,626 INFO L158 Benchmark]: TraceAbstraction took 30086.27ms. Allocated memory was 88.1MB in the beginning and 599.8MB in the end (delta: 511.7MB). Free memory was 47.8MB in the beginning and 137.1MB in the end (delta: -89.2MB). Peak memory consumption was 420.8MB. Max. memory is 16.1GB. [2022-11-18 20:03:02,627 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 599.8MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:03:02,629 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.38ms. Allocated memory is still 69.2MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.09ms. Allocated memory is still 69.2MB. Free memory was 48.5MB in the beginning and 39.6MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.81ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 37.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.81ms. Allocated memory is still 69.2MB. Free memory was 37.0MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1275.50ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 34.7MB in the beginning and 48.5MB in the end (delta: -13.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30086.27ms. Allocated memory was 88.1MB in the beginning and 599.8MB in the end (delta: 511.7MB). Free memory was 47.8MB in the beginning and 137.1MB in the end (delta: -89.2MB). Peak memory consumption was 420.8MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 599.8MB. Free memory is still 137.1MB. 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: 11.1s, 161 PlacesBefore, 57 PlacesAfterwards, 150 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 138 TotalNumberOfCompositions, 10914 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6276, independent: 6046, independent conditional: 0, independent unconditional: 6046, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2817, independent: 2758, independent conditional: 0, independent unconditional: 2758, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2817, independent: 2730, independent conditional: 0, independent unconditional: 2730, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 531, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 466, dependent conditional: 0, dependent unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6276, independent: 3288, independent conditional: 0, independent unconditional: 3288, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 2817, unknown conditional: 0, unknown unconditional: 2817] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 344, Positive conditional cache size: 0, Positive unconditional cache size: 344, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L736] 0 _Bool a$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L712] 0 int __unbuffered_p0_EAX = 0; [L720] 0 int a$mem_tmp; [L731] 0 _Bool a$read_delayed; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$r_buff1_thd1; [L733] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L735] 0 int a$w_buff1; [L719] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L732] 0 int *a$read_delayed_var; [L738] 0 _Bool main$tmp_guard1; [L737] 0 _Bool main$tmp_guard0; [L734] 0 _Bool a$w_buff0_used; [L722] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd0; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd4; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t769, ((void *)0), P0, ((void *)0))=0, t769={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t770, ((void *)0), P1, ((void *)0))=1, t769={3:0}, t770={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t771; [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t771, ((void *)0), P2, ((void *)0))=2, t769={3:0}, t770={7:0}, t771={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t772, ((void *)0), P3, ((void *)0))=3, t769={3:0}, t770={7:0}, t771={11:0}, t772={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=2, z=0] [L803] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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$$choice2=0, x=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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$$choice2=0, x=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, weak$$choice2=0, x=1, y=2, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=2, weak$$choice2=0, x=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, weak$$choice2=0, x=1, y=2, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769={3:0}, t770={7:0}, t771={11:0}, t772={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, 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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 871]: 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: 867]: 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 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 93 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2108 IncrementalHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 119 mSDtfsCounter, 2108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 3869 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 266 ConstructedInterpolants, 37 QuantifiedInterpolants, 3800 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2146 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-18 20:03:02,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c369cba-053b-485b-89bf-cad4756cf813/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample