./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a --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 cbb513b70df4783d73c8ce937f205ecfc8e5e869592c62a4af16bc0bc109e7a4 --- 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-b5237d8 [2022-11-21 16:08:29,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:08:29,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:08:29,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:08:29,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:08:29,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:08:29,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:08:29,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:08:29,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:08:29,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:08:29,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:08:29,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:08:29,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:08:29,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:08:29,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:08:29,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:08:29,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:08:29,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:08:29,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:08:29,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:08:29,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:08:29,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:08:29,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:08:29,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:08:29,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:08:29,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:08:29,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:08:29,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:08:29,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:08:29,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:08:29,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:08:29,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:08:29,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:08:29,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:08:29,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:08:29,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:08:29,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:08:29,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:08:29,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:08:29,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:08:29,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:08:29,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:08:29,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:08:29,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:08:29,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:08:29,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:08:29,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:08:29,521 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:08:29,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:08:29,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:08:29,523 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:08:29,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:08:29,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:08:29,525 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:08:29,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:08:29,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:08:29,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:08:29,526 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:08:29,527 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:08:29,527 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:08:29,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:08:29,528 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:08:29,528 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:08:29,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:08:29,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:08:29,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:08:29,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:08:29,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:08:29,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:08:29,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:08:29,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:08:29,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:08:29,532 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_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a 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 -> cbb513b70df4783d73c8ce937f205ecfc8e5e869592c62a4af16bc0bc109e7a4 [2022-11-21 16:08:29,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:08:29,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:08:29,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:08:29,867 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:08:29,868 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:08:29,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-21 16:08:33,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:08:33,709 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:08:33,710 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-21 16:08:33,738 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data/cf764df04/67eb442271484b59bb45f89eec52f60d/FLAG6f1eeb2dc [2022-11-21 16:08:33,757 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data/cf764df04/67eb442271484b59bb45f89eec52f60d [2022-11-21 16:08:33,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:08:33,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:08:33,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:08:33,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:08:33,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:08:33,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:08:33" (1/1) ... [2022-11-21 16:08:33,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8f3162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:33, skipping insertion in model container [2022-11-21 16:08:33,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:08:33" (1/1) ... [2022-11-21 16:08:33,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:08:33,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:08:34,061 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-11-21 16:08:34,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:08:34,380 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:08:34,400 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-11-21 16:08:34,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:08:34,572 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:08:34,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34 WrapperNode [2022-11-21 16:08:34,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:08:34,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:08:34,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:08:34,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:08:34,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,681 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-11-21 16:08:34,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:08:34,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:08:34,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:08:34,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:08:34,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,759 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:08:34,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:08:34,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:08:34,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:08:34,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (1/1) ... [2022-11-21 16:08:34,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:08:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:08:34,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:08:34,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:08:34,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:08:34,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:08:34,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:08:34,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:08:34,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:08:34,882 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:08:34,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:08:34,883 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:08:34,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:08:34,883 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:08:34,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:08:34,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:08:34,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:08:34,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:08:34,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:08:34,886 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:08:35,130 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:08:35,133 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:08:35,594 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:08:35,854 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:08:35,855 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:08:35,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:08:35 BoogieIcfgContainer [2022-11-21 16:08:35,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:08:35,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:08:35,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:08:35,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:08:35,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:08:33" (1/3) ... [2022-11-21 16:08:35,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d6f410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:08:35, skipping insertion in model container [2022-11-21 16:08:35,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:34" (2/3) ... [2022-11-21 16:08:35,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d6f410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:08:35, skipping insertion in model container [2022-11-21 16:08:35,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:08:35" (3/3) ... [2022-11-21 16:08:35,871 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-21 16:08:35,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:08:35,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 16:08:35,897 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:08:36,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:08:36,090 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:08:36,123 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-21 16:08:36,128 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-21 16:08:36,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-21 16:08:36,206 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-21 16:08:36,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:08:36,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 16:08:36,217 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-21 16:08:42,880 INFO L134 LiptonReduction]: Checked pairs total: 6372 [2022-11-21 16:08:42,881 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-21 16:08:42,896 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 16:08:43,049 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:43,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:08:43,080 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;@f606055, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:08:43,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 16:08:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:08:43,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:43,094 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:08:43,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 541, now seen corresponding path program 1 times [2022-11-21 16:08:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:43,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169092097] [2022-11-21 16:08:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:43,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:43,254 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-21 16:08:43,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:43,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169092097] [2022-11-21 16:08:43,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169092097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:43,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:43,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:08:43,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276918066] [2022-11-21 16:08:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:43,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:08:43,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:43,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:08:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:08:43,299 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 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-21 16:08:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:43,443 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-21 16:08:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:08:43,446 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-21 16:08:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:43,488 INFO L225 Difference]: With dead ends: 1024 [2022-11-21 16:08:43,488 INFO L226 Difference]: Without dead ends: 1024 [2022-11-21 16:08:43,490 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-21 16:08:43,497 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:43,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:08:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-21 16:08:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-21 16:08:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-21 16:08:43,658 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-21 16:08:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:43,660 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-21 16:08:43,665 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-21 16:08:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-21 16:08:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:08:43,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:43,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:08:43,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:08:43,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash 531278, now seen corresponding path program 1 times [2022-11-21 16:08:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:43,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110628385] [2022-11-21 16:08:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:44,114 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-21 16:08:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:44,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110628385] [2022-11-21 16:08:44,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110628385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:44,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:44,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:08:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606396649] [2022-11-21 16:08:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:44,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:08:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:08:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:08:44,119 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 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-21 16:08:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:44,242 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-21 16:08:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:08:44,243 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-21 16:08:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:44,250 INFO L225 Difference]: With dead ends: 837 [2022-11-21 16:08:44,250 INFO L226 Difference]: Without dead ends: 812 [2022-11-21 16:08:44,251 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-21 16:08:44,252 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:44,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:08:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-21 16:08:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-21 16:08:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-21 16:08:44,289 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-21 16:08:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:44,289 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-21 16:08:44,290 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-21 16:08:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-21 16:08:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:08:44,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:44,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:44,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:08:44,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash -584539973, now seen corresponding path program 1 times [2022-11-21 16:08:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:44,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610549556] [2022-11-21 16:08:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:44,553 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-21 16:08:44,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610549556] [2022-11-21 16:08:44,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610549556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:44,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:44,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:08:44,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818256477] [2022-11-21 16:08:44,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:44,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:08:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:44,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:08:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:08:44,557 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:44,682 INFO L93 Difference]: Finished difference Result 1359 states and 4170 transitions. [2022-11-21 16:08:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:08:44,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 16:08:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:44,700 INFO L225 Difference]: With dead ends: 1359 [2022-11-21 16:08:44,700 INFO L226 Difference]: Without dead ends: 1359 [2022-11-21 16:08:44,702 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-21 16:08:44,705 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:44,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:08:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-11-21 16:08:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1047. [2022-11-21 16:08:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1045 states have (on average 3.1732057416267945) internal successors, (3316), 1046 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 3316 transitions. [2022-11-21 16:08:44,765 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 3316 transitions. Word has length 9 [2022-11-21 16:08:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:44,767 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 3316 transitions. [2022-11-21 16:08:44,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 3316 transitions. [2022-11-21 16:08:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:08:44,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:44,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:44,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:08:44,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:44,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash -943120209, now seen corresponding path program 1 times [2022-11-21 16:08:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:44,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055743895] [2022-11-21 16:08:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:44,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:45,093 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-21 16:08:45,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:45,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055743895] [2022-11-21 16:08:45,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055743895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:45,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:45,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:08:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916928658] [2022-11-21 16:08:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:45,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:08:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:45,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:08:45,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:08:45,097 INFO L87 Difference]: Start difference. First operand 1047 states and 3316 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:45,263 INFO L93 Difference]: Finished difference Result 1395 states and 4341 transitions. [2022-11-21 16:08:45,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:08:45,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:08:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:45,274 INFO L225 Difference]: With dead ends: 1395 [2022-11-21 16:08:45,275 INFO L226 Difference]: Without dead ends: 1395 [2022-11-21 16:08:45,275 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-21 16:08:45,276 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:45,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:08:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2022-11-21 16:08:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 954. [2022-11-21 16:08:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 952 states have (on average 3.1638655462184873) internal successors, (3012), 953 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 3012 transitions. [2022-11-21 16:08:45,324 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 3012 transitions. Word has length 10 [2022-11-21 16:08:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:45,325 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 3012 transitions. [2022-11-21 16:08:45,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 3012 transitions. [2022-11-21 16:08:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:08:45,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:45,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:45,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:08:45,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -940869150, now seen corresponding path program 1 times [2022-11-21 16:08:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:45,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245257337] [2022-11-21 16:08:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:08:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:45,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245257337] [2022-11-21 16:08:45,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245257337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:45,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:45,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:08:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996111239] [2022-11-21 16:08:45,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:45,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:08:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:08:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:08:45,900 INFO L87 Difference]: Start difference. First operand 954 states and 3012 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:46,231 INFO L93 Difference]: Finished difference Result 1029 states and 3157 transitions. [2022-11-21 16:08:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:08:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:08:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:46,240 INFO L225 Difference]: With dead ends: 1029 [2022-11-21 16:08:46,240 INFO L226 Difference]: Without dead ends: 904 [2022-11-21 16:08:46,240 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-21 16:08:46,241 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:46,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 28 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:08:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-11-21 16:08:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2022-11-21 16:08:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 3.139689578713969) internal successors, (2832), 903 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 2832 transitions. [2022-11-21 16:08:46,282 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 2832 transitions. Word has length 10 [2022-11-21 16:08:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:46,283 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 2832 transitions. [2022-11-21 16:08:46,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 2832 transitions. [2022-11-21 16:08:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:08:46,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:46,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:46,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:08:46,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:46,287 INFO L85 PathProgramCache]: Analyzing trace with hash 828045422, now seen corresponding path program 1 times [2022-11-21 16:08:46,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:46,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937345586] [2022-11-21 16:08:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:46,830 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-21 16:08:46,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:46,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937345586] [2022-11-21 16:08:46,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937345586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:46,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:46,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:08:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630588813] [2022-11-21 16:08:46,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:08:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:08:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:08:46,835 INFO L87 Difference]: Start difference. First operand 904 states and 2832 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:47,259 INFO L93 Difference]: Finished difference Result 1005 states and 3066 transitions. [2022-11-21 16:08:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:08:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:08:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:47,266 INFO L225 Difference]: With dead ends: 1005 [2022-11-21 16:08:47,266 INFO L226 Difference]: Without dead ends: 605 [2022-11-21 16:08:47,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:08:47,269 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:47,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 35 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:08:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-21 16:08:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2022-11-21 16:08:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 603 states have (on average 2.9784411276948592) internal successors, (1796), 604 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1796 transitions. [2022-11-21 16:08:47,306 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1796 transitions. Word has length 11 [2022-11-21 16:08:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:47,306 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 1796 transitions. [2022-11-21 16:08:47,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1796 transitions. [2022-11-21 16:08:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:08:47,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:47,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:47,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:08:47,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 430630460, now seen corresponding path program 1 times [2022-11-21 16:08:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:47,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113961737] [2022-11-21 16:08:47,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:47,512 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-21 16:08:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:47,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113961737] [2022-11-21 16:08:47,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113961737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:47,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:47,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:08:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760993196] [2022-11-21 16:08:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:47,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:08:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:08:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:08:47,515 INFO L87 Difference]: Start difference. First operand 605 states and 1796 transitions. Second operand has 4 states, 4 states have (on average 3.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-21 16:08:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:47,671 INFO L93 Difference]: Finished difference Result 550 states and 1411 transitions. [2022-11-21 16:08:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:08:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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-21 16:08:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:47,675 INFO L225 Difference]: With dead ends: 550 [2022-11-21 16:08:47,675 INFO L226 Difference]: Without dead ends: 429 [2022-11-21 16:08:47,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 16:08:47,676 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:47,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:08:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-11-21 16:08:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2022-11-21 16:08:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 2.566744730679157) internal successors, (1096), 428 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1096 transitions. [2022-11-21 16:08:47,692 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1096 transitions. Word has length 12 [2022-11-21 16:08:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:47,693 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 1096 transitions. [2022-11-21 16:08:47,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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-21 16:08:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1096 transitions. [2022-11-21 16:08:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:08:47,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:47,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:47,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:08:47,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1423171484, now seen corresponding path program 1 times [2022-11-21 16:08:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83457412] [2022-11-21 16:08:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:47,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-21 16:08:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:47,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83457412] [2022-11-21 16:08:47,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83457412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:47,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:47,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:08:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665755730] [2022-11-21 16:08:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:47,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:08:47,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:47,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:08:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:08:47,931 INFO L87 Difference]: Start difference. First operand 429 states and 1096 transitions. Second operand has 5 states, 5 states have (on average 2.8) 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-21 16:08:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:48,127 INFO L93 Difference]: Finished difference Result 320 states and 715 transitions. [2022-11-21 16:08:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:08:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) 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-21 16:08:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:48,129 INFO L225 Difference]: With dead ends: 320 [2022-11-21 16:08:48,129 INFO L226 Difference]: Without dead ends: 251 [2022-11-21 16:08:48,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:08:48,130 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 12 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-21 16:08:48,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 12 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:08:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-21 16:08:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-21 16:08:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 249 states have (on average 2.208835341365462) internal successors, (550), 250 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 550 transitions. [2022-11-21 16:08:48,139 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 550 transitions. Word has length 14 [2022-11-21 16:08:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:48,140 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 550 transitions. [2022-11-21 16:08:48,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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-21 16:08:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 550 transitions. [2022-11-21 16:08:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:08:48,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:48,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:48,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:08:48,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash -802454956, now seen corresponding path program 1 times [2022-11-21 16:08:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:48,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942712049] [2022-11-21 16:08:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:48,506 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-21 16:08:48,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:48,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942712049] [2022-11-21 16:08:48,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942712049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:48,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:48,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:08:48,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792081238] [2022-11-21 16:08:48,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:48,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:08:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:48,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:08:48,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:08:48,515 INFO L87 Difference]: Start difference. First operand 251 states and 550 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:48,698 INFO L93 Difference]: Finished difference Result 209 states and 455 transitions. [2022-11-21 16:08:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:08:48,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:08:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:48,700 INFO L225 Difference]: With dead ends: 209 [2022-11-21 16:08:48,701 INFO L226 Difference]: Without dead ends: 190 [2022-11-21 16:08:48,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:08:48,702 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:48,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 10 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:08:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-21 16:08:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2022-11-21 16:08:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.2346368715083798) internal successors, (400), 180 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 400 transitions. [2022-11-21 16:08:48,710 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 400 transitions. Word has length 17 [2022-11-21 16:08:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:48,711 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 400 transitions. [2022-11-21 16:08:48,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 400 transitions. [2022-11-21 16:08:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:08:48,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:48,712 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-21 16:08:48,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:08:48,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash -641163453, now seen corresponding path program 1 times [2022-11-21 16:08:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:48,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602614089] [2022-11-21 16:08:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:49,024 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-21 16:08:49,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:49,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602614089] [2022-11-21 16:08:49,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602614089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:49,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:49,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:08:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819629721] [2022-11-21 16:08:49,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:08:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:08:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:08:49,028 INFO L87 Difference]: Start difference. First operand 181 states and 400 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-21 16:08:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:49,119 INFO L93 Difference]: Finished difference Result 257 states and 563 transitions. [2022-11-21 16:08:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:08:49,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-21 16:08:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:49,121 INFO L225 Difference]: With dead ends: 257 [2022-11-21 16:08:49,121 INFO L226 Difference]: Without dead ends: 257 [2022-11-21 16:08:49,121 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-21 16:08:49,122 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:49,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:08:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-21 16:08:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2022-11-21 16:08:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 2.2544642857142856) internal successors, (505), 225 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:08:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 505 transitions. [2022-11-21 16:08:49,132 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 505 transitions. Word has length 21 [2022-11-21 16:08:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:49,132 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 505 transitions. [2022-11-21 16:08:49,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-21 16:08:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 505 transitions. [2022-11-21 16:08:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:08:49,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:49,134 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-21 16:08:49,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:08:49,135 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:08:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1003076369, now seen corresponding path program 2 times [2022-11-21 16:08:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:49,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530688992] [2022-11-21 16:08:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:08:49,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:08:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:08:49,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:08:49,396 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:08:49,398 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 16:08:49,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 16:08:49,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 16:08:49,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 16:08:49,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 16:08:49,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 16:08:49,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 16:08:49,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 16:08:49,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 16:08:49,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 16:08:49,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 16:08:49,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 16:08:49,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 16:08:49,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:08:49,406 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:49,413 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:08:49,413 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:08:49,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:08:49 BasicIcfg [2022-11-21 16:08:49,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:08:49,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:08:49,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:08:49,519 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:08:49,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:08:35" (3/4) ... [2022-11-21 16:08:49,523 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:08:49,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:08:49,524 INFO L158 Benchmark]: Toolchain (without parser) took 15758.83ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 115.0MB in the beginning and 139.9MB in the end (delta: -24.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 16:08:49,525 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 119.5MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:08:49,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 808.19ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 91.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 16:08:49,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.58ms. Allocated memory is still 157.3MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:08:49,526 INFO L158 Benchmark]: Boogie Preprocessor took 74.55ms. Allocated memory is still 157.3MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:08:49,526 INFO L158 Benchmark]: RCFGBuilder took 1093.14ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 52.1MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-21 16:08:49,527 INFO L158 Benchmark]: TraceAbstraction took 13656.46ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 51.2MB in the beginning and 139.9MB in the end (delta: -88.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2022-11-21 16:08:49,528 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 188.7MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:08:49,531 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.26ms. Allocated memory is still 119.5MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 808.19ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 91.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.58ms. Allocated memory is still 157.3MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.55ms. Allocated memory is still 157.3MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1093.14ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 52.1MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13656.46ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 51.2MB in the beginning and 139.9MB in the end (delta: -88.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 188.7MB. Free memory is still 139.9MB. 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: 6.8s, 133 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 6372 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3134, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1662, independent: 1606, independent conditional: 0, independent unconditional: 1606, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1662, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 602, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 520, dependent conditional: 0, dependent unconditional: 520, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3134, independent: 1348, independent conditional: 0, independent unconditional: 1348, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 1662, unknown conditional: 0, unknown unconditional: 1662] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 178, Positive conditional cache size: 0, Positive unconditional cache size: 178, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2281, ((void *)0), P0, ((void *)0))=-3, t2281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t2282; [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2282, ((void *)0), P1, ((void *)0))=-2, t2281={5:0}, t2282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2283, ((void *)0), P2, ((void *)0))=-1, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 919 IncrementalHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 39 mSDtfsCounter, 919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 793 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-21 16:08:49,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a --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 cbb513b70df4783d73c8ce937f205ecfc8e5e869592c62a4af16bc0bc109e7a4 --- 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-b5237d8 [2022-11-21 16:08:52,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:08:52,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:08:52,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:08:52,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:08:52,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:08:52,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:08:52,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:08:52,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:08:52,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:08:52,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:08:52,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:08:52,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:08:52,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:08:52,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:08:52,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:08:52,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:08:52,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:08:52,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:08:52,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:08:52,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:08:52,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:08:52,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:08:52,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:08:52,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:08:52,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:08:52,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:08:52,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:08:52,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:08:52,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:08:52,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:08:52,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:08:52,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:08:52,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:08:52,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:08:52,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:08:52,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:08:52,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:08:52,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:08:52,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:08:52,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:08:52,697 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 16:08:52,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:08:52,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:08:52,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:08:52,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:08:52,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:08:52,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:08:52,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:08:52,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:08:52,747 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:08:52,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:08:52,748 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:08:52,749 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:08:52,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:08:52,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:08:52,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:08:52,750 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:08:52,750 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:08:52,750 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:08:52,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:08:52,751 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:08:52,751 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:08:52,751 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:08:52,752 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:08:52,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:08:52,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:08:52,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:08:52,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:08:52,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:08:52,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:08:52,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:08:52,754 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:08:52,754 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:08:52,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:08:52,755 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_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a 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 -> cbb513b70df4783d73c8ce937f205ecfc8e5e869592c62a4af16bc0bc109e7a4 [2022-11-21 16:08:53,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:08:53,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:08:53,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:08:53,242 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:08:53,243 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:08:53,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-21 16:08:56,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:08:57,097 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:08:57,099 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-21 16:08:57,128 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data/ffa71a621/165f77bc4c7746d59f5ec1766eb1e66f/FLAGfba0f5812 [2022-11-21 16:08:57,146 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/data/ffa71a621/165f77bc4c7746d59f5ec1766eb1e66f [2022-11-21 16:08:57,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:08:57,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:08:57,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:08:57,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:08:57,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:08:57,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:57,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1cc029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57, skipping insertion in model container [2022-11-21 16:08:57,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:57,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:08:57,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:08:57,432 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-11-21 16:08:57,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:08:57,695 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:08:57,712 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/sv-benchmarks/c/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-11-21 16:08:57,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:08:57,923 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:08:57,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57 WrapperNode [2022-11-21 16:08:57,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:08:57,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:08:57,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:08:57,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:08:57,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:57,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,034 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-21 16:08:58,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:08:58,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:08:58,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:08:58,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:08:58,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,087 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:08:58,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:08:58,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:08:58,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:08:58,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (1/1) ... [2022-11-21 16:08:58,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:08:58,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:08:58,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:08:58,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:08:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:08:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:08:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:08:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:08:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 16:08:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 16:08:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:08:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:08:58,211 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:08:58,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:08:58,212 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:08:58,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:08:58,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:08:58,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:08:58,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:08:58,215 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:08:58,507 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:08:58,510 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:08:59,077 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:08:59,342 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:08:59,343 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:08:59,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:08:59 BoogieIcfgContainer [2022-11-21 16:08:59,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:08:59,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:08:59,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:08:59,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:08:59,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:08:57" (1/3) ... [2022-11-21 16:08:59,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248ab252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:08:59, skipping insertion in model container [2022-11-21 16:08:59,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:08:57" (2/3) ... [2022-11-21 16:08:59,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248ab252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:08:59, skipping insertion in model container [2022-11-21 16:08:59,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:08:59" (3/3) ... [2022-11-21 16:08:59,360 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-21 16:08:59,385 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:08:59,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 16:08:59,386 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:08:59,501 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:08:59,560 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:08:59,596 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 267 flow [2022-11-21 16:08:59,611 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 267 flow [2022-11-21 16:08:59,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-11-21 16:08:59,700 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-11-21 16:08:59,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:08:59,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 16:08:59,710 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-21 16:09:10,750 INFO L134 LiptonReduction]: Checked pairs total: 6325 [2022-11-21 16:09:10,750 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-21 16:09:10,762 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 16:09:10,873 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:10,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:09:10,903 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;@507355b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:09:10,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 16:09:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:09:10,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:10,916 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:09:10,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2022-11-21 16:09:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:10,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214953009] [2022-11-21 16:09:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:10,950 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-21 16:09:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:10,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:11,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:11,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 16:09:11,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:11,113 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-21 16:09:11,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:11,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:09:11,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214953009] [2022-11-21 16:09:11,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214953009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:11,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:11,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:09:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701194347] [2022-11-21 16:09:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:11,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:09:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:09:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:09:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:09:11,165 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 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-21 16:09:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:11,422 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-21 16:09:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:09:11,439 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-21 16:09:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:11,474 INFO L225 Difference]: With dead ends: 1024 [2022-11-21 16:09:11,474 INFO L226 Difference]: Without dead ends: 1024 [2022-11-21 16:09:11,476 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-21 16:09:11,480 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:11,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-21 16:09:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-21 16:09:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-21 16:09:11,627 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-21 16:09:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:11,627 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-21 16:09:11,628 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-21 16:09:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-21 16:09:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:09:11,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:11,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:09:11,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:11,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:11,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 534281, now seen corresponding path program 1 times [2022-11-21 16:09:11,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:11,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042930714] [2022-11-21 16:09:11,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:11,845 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-21 16:09:11,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:11,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:11,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:11,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:09:11,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:12,016 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-21 16:09:12,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:12,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:09:12,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042930714] [2022-11-21 16:09:12,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042930714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:12,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:12,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:09:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284981453] [2022-11-21 16:09:12,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:09:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:12,022 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 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-21 16:09:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:12,157 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-21 16:09:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:12,158 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-21 16:09:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:12,165 INFO L225 Difference]: With dead ends: 837 [2022-11-21 16:09:12,166 INFO L226 Difference]: Without dead ends: 812 [2022-11-21 16:09:12,166 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-21 16:09:12,168 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:12,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-21 16:09:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-21 16:09:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-21 16:09:12,217 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-21 16:09:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:12,217 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-21 16:09:12,218 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-21 16:09:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-21 16:09:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:09:12,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:12,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:12,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:12,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:12,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1748838777, now seen corresponding path program 1 times [2022-11-21 16:09:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:12,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828707328] [2022-11-21 16:09:12,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:12,437 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-21 16:09:12,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:12,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:12,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:09:12,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:12,679 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-21 16:09:12,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:12,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:09:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828707328] [2022-11-21 16:09:12,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828707328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:12,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:12,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:09:12,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120440305] [2022-11-21 16:09:12,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:12,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:09:12,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:09:12,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:09:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:09:12,685 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:12,920 INFO L93 Difference]: Finished difference Result 617 states and 1659 transitions. [2022-11-21 16:09:12,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:12,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 16:09:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:12,928 INFO L225 Difference]: With dead ends: 617 [2022-11-21 16:09:12,928 INFO L226 Difference]: Without dead ends: 492 [2022-11-21 16:09:12,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-21 16:09:12,934 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:12,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 10 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:09:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-21 16:09:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2022-11-21 16:09:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 490 states have (on average 2.642857142857143) internal successors, (1295), 491 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1295 transitions. [2022-11-21 16:09:12,965 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1295 transitions. Word has length 9 [2022-11-21 16:09:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:12,967 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1295 transitions. [2022-11-21 16:09:12,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1295 transitions. [2022-11-21 16:09:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:09:12,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:12,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:12,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:13,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:13,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash 310082785, now seen corresponding path program 1 times [2022-11-21 16:09:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:13,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778127665] [2022-11-21 16:09:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:13,199 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-21 16:09:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:13,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:13,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:09:13,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:13,428 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-21 16:09:13,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:13,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:09:13,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778127665] [2022-11-21 16:09:13,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778127665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:13,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:13,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:09:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188737971] [2022-11-21 16:09:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:13,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:09:13,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:09:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:09:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:13,434 INFO L87 Difference]: Start difference. First operand 492 states and 1295 transitions. Second operand has 5 states, 5 states have (on average 2.6) 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-21 16:09:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:13,732 INFO L93 Difference]: Finished difference Result 313 states and 731 transitions. [2022-11-21 16:09:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:09:13,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) 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-21 16:09:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:13,735 INFO L225 Difference]: With dead ends: 313 [2022-11-21 16:09:13,735 INFO L226 Difference]: Without dead ends: 252 [2022-11-21 16:09:13,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:09:13,736 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:13,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:09:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-21 16:09:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-21 16:09:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 250 states have (on average 2.3) internal successors, (575), 251 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 575 transitions. [2022-11-21 16:09:13,754 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 575 transitions. Word has length 13 [2022-11-21 16:09:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:13,755 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 575 transitions. [2022-11-21 16:09:13,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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-21 16:09:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 575 transitions. [2022-11-21 16:09:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:09:13,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:13,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:13,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:13,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:13,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1359310671, now seen corresponding path program 1 times [2022-11-21 16:09:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927919826] [2022-11-21 16:09:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:13,985 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-21 16:09:13,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:13,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:13,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:14,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:09:14,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:14,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:14,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:09:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927919826] [2022-11-21 16:09:14,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927919826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:14,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:14,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:09:14,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780754953] [2022-11-21 16:09:14,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:14,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:09:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:09:14,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:09:14,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:09:14,274 INFO L87 Difference]: Start difference. First operand 252 states and 575 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:14,653 INFO L93 Difference]: Finished difference Result 205 states and 479 transitions. [2022-11-21 16:09:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:09:14,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:09:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:14,656 INFO L225 Difference]: With dead ends: 205 [2022-11-21 16:09:14,656 INFO L226 Difference]: Without dead ends: 192 [2022-11-21 16:09:14,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:09:14,657 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:14,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:09:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-21 16:09:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-21 16:09:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.3947368421052633) internal successors, (455), 191 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 455 transitions. [2022-11-21 16:09:14,665 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 455 transitions. Word has length 17 [2022-11-21 16:09:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:14,666 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 455 transitions. [2022-11-21 16:09:14,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 455 transitions. [2022-11-21 16:09:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:09:14,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:14,668 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-21 16:09:14,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:14,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:14,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1894498955, now seen corresponding path program 1 times [2022-11-21 16:09:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:14,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881462920] [2022-11-21 16:09:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:14,889 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-21 16:09:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:14,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:14,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:09:15,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:15,093 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-21 16:09:15,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:15,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:09:15,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881462920] [2022-11-21 16:09:15,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881462920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:15,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:15,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:09:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760423813] [2022-11-21 16:09:15,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:15,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:15,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:09:15,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:15,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:15,102 INFO L87 Difference]: Start difference. First operand 192 states and 455 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-21 16:09:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:15,229 INFO L93 Difference]: Finished difference Result 280 states and 650 transitions. [2022-11-21 16:09:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-21 16:09:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:15,232 INFO L225 Difference]: With dead ends: 280 [2022-11-21 16:09:15,232 INFO L226 Difference]: Without dead ends: 280 [2022-11-21 16:09:15,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-21 16:09:15,233 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:15,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-21 16:09:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2022-11-21 16:09:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 276 states have (on average 2.351449275362319) internal successors, (649), 277 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 649 transitions. [2022-11-21 16:09:15,250 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 649 transitions. Word has length 21 [2022-11-21 16:09:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:15,250 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 649 transitions. [2022-11-21 16:09:15,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-21 16:09:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 649 transitions. [2022-11-21 16:09:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:09:15,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:15,253 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-21 16:09:15,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:15,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:15,469 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 131193973, now seen corresponding path program 2 times [2022-11-21 16:09:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:15,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410134580] [2022-11-21 16:09:15,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:09:15,470 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-21 16:09:15,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:15,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:15,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:15,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:09:15,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:09:15,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:09:15,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:15,741 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-21 16:09:15,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:15,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:09:15,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410134580] [2022-11-21 16:09:15,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410134580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:15,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:15,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:09:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708873893] [2022-11-21 16:09:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:15,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:09:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:09:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:09:15,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:09:15,747 INFO L87 Difference]: Start difference. First operand 278 states and 649 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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-21 16:09:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:15,912 INFO L93 Difference]: Finished difference Result 380 states and 864 transitions. [2022-11-21 16:09:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:09:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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-21 16:09:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:15,915 INFO L225 Difference]: With dead ends: 380 [2022-11-21 16:09:15,916 INFO L226 Difference]: Without dead ends: 380 [2022-11-21 16:09:15,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-21 16:09:15,917 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:15,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-21 16:09:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2022-11-21 16:09:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 264 states have (on average 2.3484848484848486) internal successors, (620), 265 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 620 transitions. [2022-11-21 16:09:15,929 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 620 transitions. Word has length 21 [2022-11-21 16:09:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:15,930 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 620 transitions. [2022-11-21 16:09:15,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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-21 16:09:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 620 transitions. [2022-11-21 16:09:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:09:15,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:15,932 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-21 16:09:15,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:16,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:16,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:09:16,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:16,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2029009525, now seen corresponding path program 3 times [2022-11-21 16:09:16,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:09:16,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260750597] [2022-11-21 16:09:16,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:09:16,149 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-21 16:09:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:09:16,150 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:16,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:16,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 16:09:16,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 16:09:16,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:09:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:09:16,532 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 16:09:16,532 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:09:16,534 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 16:09:16,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 16:09:16,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 16:09:16,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 16:09:16,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 16:09:16,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 16:09:16,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 16:09:16,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 16:09:16,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 16:09:16,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 16:09:16,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 16:09:16,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 16:09:16,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 16:09:16,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:16,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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-21 16:09:16,761 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-21 16:09:16,766 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:09:16,766 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:09:16,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:09:16 BasicIcfg [2022-11-21 16:09:16,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:09:16,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:09:16,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:09:16,892 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:09:16,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:08:59" (3/4) ... [2022-11-21 16:09:16,896 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:09:16,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:09:16,897 INFO L158 Benchmark]: Toolchain (without parser) took 19745.87ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 59.9MB in the beginning and 57.4MB in the end (delta: 2.5MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-11-21 16:09:16,897 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 65.0MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:09:16,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.58ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 56.0MB in the end (delta: 3.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2022-11-21 16:09:16,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.25ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 53.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:09:16,898 INFO L158 Benchmark]: Boogie Preprocessor took 56.37ms. Allocated memory is still 83.9MB. Free memory was 53.3MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:09:16,899 INFO L158 Benchmark]: RCFGBuilder took 1251.60ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 54.4MB in the end (delta: -3.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-11-21 16:09:16,899 INFO L158 Benchmark]: TraceAbstraction took 17541.30ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 53.8MB in the beginning and 58.5MB in the end (delta: -4.6MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-11-21 16:09:16,899 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 121.6MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:09:16,902 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.36ms. Allocated memory is still 65.0MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.58ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 56.0MB in the end (delta: 3.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.25ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 53.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.37ms. Allocated memory is still 83.9MB. Free memory was 53.3MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1251.60ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 54.4MB in the end (delta: -3.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17541.30ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 53.8MB in the beginning and 58.5MB in the end (delta: -4.6MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 121.6MB. Free memory is still 57.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: 11.1s, 134 PlacesBefore, 44 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6325 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3183, independent: 3005, independent conditional: 0, independent unconditional: 3005, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1711, independent: 1656, independent conditional: 0, independent unconditional: 1656, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1711, independent: 1629, independent conditional: 0, independent unconditional: 1629, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 469, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 407, dependent conditional: 0, dependent unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3183, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 1711, unknown conditional: 0, unknown unconditional: 1711] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2281, ((void *)0), P0, ((void *)0))=-1, t2281={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t2282; [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2282, ((void *)0), P1, ((void *)0))=0, t2281={-6:0}, t2282={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2283, ((void *)0), P2, ((void *)0))=1, t2281={-6:0}, t2282={-10:0}, t2283={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2281={-6:0}, t2282={-10:0}, t2283={-2:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 27 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 116 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 198 SizeOfPredicates, 13 NumberOfNonLiveVariables, 757 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-21 16:09:16,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76296634-40bd-42b7-818f-b90e1b05679a/bin/uautomizer-vX5HgA9Q3a/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