./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:56:02,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:56:02,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:56:02,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:56:02,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:56:02,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:56:02,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:56:02,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:56:02,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:56:02,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:56:02,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:56:02,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:56:02,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:56:02,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:56:02,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:56:02,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:56:02,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:56:02,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:56:02,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:56:02,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:56:02,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:56:02,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:56:02,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:56:02,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:56:02,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:56:02,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:56:02,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:56:02,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:56:02,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:56:02,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:56:02,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:56:02,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:56:02,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:56:02,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:56:02,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:56:02,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:56:02,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:56:02,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:56:02,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:56:02,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:56:02,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:56:02,691 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:56:02,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:56:02,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:56:02,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:56:02,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:56:02,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:56:02,736 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:56:02,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:56:02,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:56:02,737 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:56:02,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:56:02,737 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:56:02,737 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:56:02,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:56:02,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:56:02,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:56:02,743 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:56:02,744 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:56:02,744 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:56:02,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:56:02,744 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:56:02,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:56:02,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:56:02,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:56:02,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:56:02,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:56:02,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:02,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:56:02,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:56:02,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:56:02,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:56:02,748 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_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2022-11-20 10:56:03,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:56:03,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:56:03,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:56:03,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:56:03,127 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:56:03,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-20 10:56:06,203 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:56:06,503 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:56:06,504 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-20 10:56:06,518 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data/ad6b47f79/90235a73f8b24c71ace61395e86f9418/FLAGc19f2599b [2022-11-20 10:56:06,533 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data/ad6b47f79/90235a73f8b24c71ace61395e86f9418 [2022-11-20 10:56:06,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:56:06,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:56:06,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:06,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:56:06,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:56:06,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:06" (1/1) ... [2022-11-20 10:56:06,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b49d1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:06, skipping insertion in model container [2022-11-20 10:56:06,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:06" (1/1) ... [2022-11-20 10:56:06,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:56:06,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:56:06,829 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_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-20 10:56:07,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:07,123 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:56:07,134 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_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-20 10:56:07,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:07,230 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:56:07,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07 WrapperNode [2022-11-20 10:56:07,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:07,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:07,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:56:07,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:56:07,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,283 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-20 10:56:07,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:07,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:56:07,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:56:07,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:56:07,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:56:07,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:56:07,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:56:07,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:56:07,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (1/1) ... [2022-11-20 10:56:07,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:07,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:56:07,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:56:07,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:56:07,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:56:07,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:56:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:56:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:56:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:56:07,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:56:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:56:07,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:56:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:56:07,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:56:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:56:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:56:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:56:07,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:56:07,436 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:56:07,657 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:56:07,659 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:56:07,986 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:56:08,204 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:56:08,208 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:56:08,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:08 BoogieIcfgContainer [2022-11-20 10:56:08,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:56:08,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:56:08,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:56:08,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:56:08,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:56:06" (1/3) ... [2022-11-20 10:56:08,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5582eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:08, skipping insertion in model container [2022-11-20 10:56:08,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:07" (2/3) ... [2022-11-20 10:56:08,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5582eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:08, skipping insertion in model container [2022-11-20 10:56:08,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:08" (3/3) ... [2022-11-20 10:56:08,223 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-11-20 10:56:08,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:56:08,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 10:56:08,241 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:56:08,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:56:08,379 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:56:08,406 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-20 10:56:08,413 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-20 10:56:08,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-11-20 10:56:08,516 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-20 10:56:08,517 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:56:08,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-20 10:56:08,563 INFO L119 LiptonReduction]: Number of co-enabled transitions 2364 [2022-11-20 10:56:14,750 INFO L134 LiptonReduction]: Checked pairs total: 5987 [2022-11-20 10:56:14,750 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-20 10:56:14,763 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 33 transitions, 81 flow [2022-11-20 10:56:14,856 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 884 states, 871 states have (on average 3.1504018369690012) internal successors, (2744), 883 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:14,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:56:14,882 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;@76c6630e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:56:14,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-20 10:56:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 871 states have (on average 3.1504018369690012) internal successors, (2744), 883 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:56:14,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:14,896 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:56:14,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2022-11-20 10:56:14,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:14,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232965770] [2022-11-20 10:56:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:15,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232965770] [2022-11-20 10:56:15,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232965770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:15,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:15,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:56:15,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341877294] [2022-11-20 10:56:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:15,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:56:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:56:15,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:56:15,124 INFO L87 Difference]: Start difference. First operand has 884 states, 871 states have (on average 3.1504018369690012) internal successors, (2744), 883 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:15,231 INFO L93 Difference]: Finished difference Result 826 states and 2604 transitions. [2022-11-20 10:56:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:56:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 10:56:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:15,280 INFO L225 Difference]: With dead ends: 826 [2022-11-20 10:56:15,281 INFO L226 Difference]: Without dead ends: 826 [2022-11-20 10:56:15,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:56:15,287 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:15,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-11-20 10:56:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2022-11-20 10:56:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 821 states have (on average 3.171741778319123) internal successors, (2604), 825 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2604 transitions. [2022-11-20 10:56:15,434 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2604 transitions. Word has length 1 [2022-11-20 10:56:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:15,436 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 2604 transitions. [2022-11-20 10:56:15,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2604 transitions. [2022-11-20 10:56:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 10:56:15,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:15,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 10:56:15,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:56:15,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:15,445 INFO L85 PathProgramCache]: Analyzing trace with hash 513399789, now seen corresponding path program 1 times [2022-11-20 10:56:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:15,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625592179] [2022-11-20 10:56:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:15,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:15,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625592179] [2022-11-20 10:56:15,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625592179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:15,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:15,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:56:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739090555] [2022-11-20 10:56:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:15,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:15,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:15,830 INFO L87 Difference]: Start difference. First operand 826 states and 2604 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:15,941 INFO L93 Difference]: Finished difference Result 674 states and 2090 transitions. [2022-11-20 10:56:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:15,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 10:56:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:15,949 INFO L225 Difference]: With dead ends: 674 [2022-11-20 10:56:15,950 INFO L226 Difference]: Without dead ends: 650 [2022-11-20 10:56:15,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:15,959 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:15,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-20 10:56:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-20 10:56:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-20 10:56:15,998 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2022-11-20 10:56:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:15,999 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-20 10:56:15,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-20 10:56:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:56:16,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:16,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:16,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:56:16,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1238464255, now seen corresponding path program 1 times [2022-11-20 10:56:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:16,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834972874] [2022-11-20 10:56:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834972874] [2022-11-20 10:56:16,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834972874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:16,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:16,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:56:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749516856] [2022-11-20 10:56:16,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:16,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:16,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:16,385 INFO L87 Difference]: Start difference. First operand 650 states and 2028 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-20 10:56:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:16,500 INFO L93 Difference]: Finished difference Result 754 states and 2258 transitions. [2022-11-20 10:56:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:16,500 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-20 10:56:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:16,507 INFO L225 Difference]: With dead ends: 754 [2022-11-20 10:56:16,508 INFO L226 Difference]: Without dead ends: 754 [2022-11-20 10:56:16,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:16,512 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:16,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-20 10:56:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 642. [2022-11-20 10:56:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 640 states have (on average 3.11875) internal successors, (1996), 641 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1996 transitions. [2022-11-20 10:56:16,548 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1996 transitions. Word has length 9 [2022-11-20 10:56:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:16,549 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 1996 transitions. [2022-11-20 10:56:16,550 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-20 10:56:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1996 transitions. [2022-11-20 10:56:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:56:16,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:16,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:16,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:56:16,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1238464265, now seen corresponding path program 1 times [2022-11-20 10:56:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:16,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373648042] [2022-11-20 10:56:16,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:16,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:17,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373648042] [2022-11-20 10:56:17,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373648042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:17,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:17,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144369972] [2022-11-20 10:56:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:17,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:17,094 INFO L87 Difference]: Start difference. First operand 642 states and 1996 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:17,281 INFO L93 Difference]: Finished difference Result 522 states and 1590 transitions. [2022-11-20 10:56:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:17,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:56:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:17,286 INFO L225 Difference]: With dead ends: 522 [2022-11-20 10:56:17,286 INFO L226 Difference]: Without dead ends: 522 [2022-11-20 10:56:17,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:17,288 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:17,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-20 10:56:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2022-11-20 10:56:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 3.0518234165067177) internal successors, (1590), 521 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1590 transitions. [2022-11-20 10:56:17,317 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1590 transitions. Word has length 9 [2022-11-20 10:56:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:17,318 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1590 transitions. [2022-11-20 10:56:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1590 transitions. [2022-11-20 10:56:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:56:17,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:17,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:17,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:56:17,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -878253493, now seen corresponding path program 1 times [2022-11-20 10:56:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:17,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224564561] [2022-11-20 10:56:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224564561] [2022-11-20 10:56:17,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224564561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:17,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:17,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:56:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059617161] [2022-11-20 10:56:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:17,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:56:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:56:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:56:17,643 INFO L87 Difference]: Start difference. First operand 522 states and 1590 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:17,734 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2022-11-20 10:56:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:17,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 10:56:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:17,739 INFO L225 Difference]: With dead ends: 490 [2022-11-20 10:56:17,740 INFO L226 Difference]: Without dead ends: 490 [2022-11-20 10:56:17,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:56:17,741 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:17,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-20 10:56:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2022-11-20 10:56:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.0265848670756648) internal successors, (1480), 489 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2022-11-20 10:56:17,762 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 11 [2022-11-20 10:56:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:17,763 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2022-11-20 10:56:17,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2022-11-20 10:56:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:56:17,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:17,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:17,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:56:17,766 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash 366073679, now seen corresponding path program 1 times [2022-11-20 10:56:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:17,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274935205] [2022-11-20 10:56:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:18,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274935205] [2022-11-20 10:56:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274935205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878392152] [2022-11-20 10:56:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:18,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:56:18,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:18,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:56:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:56:18,082 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:18,237 INFO L93 Difference]: Finished difference Result 454 states and 1202 transitions. [2022-11-20 10:56:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:18,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 10:56:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:18,240 INFO L225 Difference]: With dead ends: 454 [2022-11-20 10:56:18,240 INFO L226 Difference]: Without dead ends: 334 [2022-11-20 10:56:18,241 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-20 10:56:18,241 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:18,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-20 10:56:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-11-20 10:56:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.5705705705705704) internal successors, (856), 333 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 856 transitions. [2022-11-20 10:56:18,255 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 856 transitions. Word has length 11 [2022-11-20 10:56:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:18,255 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 856 transitions. [2022-11-20 10:56:18,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 856 transitions. [2022-11-20 10:56:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:56:18,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:18,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:18,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:56:18,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1440479958, now seen corresponding path program 1 times [2022-11-20 10:56:18,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:18,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332545052] [2022-11-20 10:56:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:18,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332545052] [2022-11-20 10:56:18,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332545052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:18,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:18,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:56:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784447760] [2022-11-20 10:56:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:18,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:18,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:18,509 INFO L87 Difference]: Start difference. First operand 334 states and 856 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-20 10:56:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:18,706 INFO L93 Difference]: Finished difference Result 267 states and 628 transitions. [2022-11-20 10:56:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:56:18,707 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-20 10:56:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:18,708 INFO L225 Difference]: With dead ends: 267 [2022-11-20 10:56:18,708 INFO L226 Difference]: Without dead ends: 207 [2022-11-20 10:56:18,708 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-20 10:56:18,709 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:18,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 14 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-20 10:56:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-20 10:56:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.3058252427184467) internal successors, (475), 206 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 475 transitions. [2022-11-20 10:56:18,716 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 475 transitions. Word has length 14 [2022-11-20 10:56:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:18,716 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 475 transitions. [2022-11-20 10:56:18,716 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-20 10:56:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 475 transitions. [2022-11-20 10:56:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:56:18,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:18,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:18,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:56:18,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1398430014, now seen corresponding path program 1 times [2022-11-20 10:56:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:18,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685202884] [2022-11-20 10:56:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:19,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685202884] [2022-11-20 10:56:19,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685202884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:19,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:19,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:19,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905218328] [2022-11-20 10:56:19,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:19,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:56:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:56:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:56:19,043 INFO L87 Difference]: Start difference. First operand 207 states and 475 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-20 10:56:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:19,186 INFO L93 Difference]: Finished difference Result 273 states and 607 transitions. [2022-11-20 10:56:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:19,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-20 10:56:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:19,189 INFO L225 Difference]: With dead ends: 273 [2022-11-20 10:56:19,189 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 10:56:19,189 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-20 10:56:19,190 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:19,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 10:56:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2022-11-20 10:56:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.257510729613734) internal successors, (526), 233 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 526 transitions. [2022-11-20 10:56:19,202 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 526 transitions. Word has length 17 [2022-11-20 10:56:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:19,202 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 526 transitions. [2022-11-20 10:56:19,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-20 10:56:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 526 transitions. [2022-11-20 10:56:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:56:19,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:19,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:19,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:56:19,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1720463340, now seen corresponding path program 2 times [2022-11-20 10:56:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:19,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109305108] [2022-11-20 10:56:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:19,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109305108] [2022-11-20 10:56:19,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109305108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:19,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:19,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:56:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294431787] [2022-11-20 10:56:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:19,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:19,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:19,553 INFO L87 Difference]: Start difference. First operand 234 states and 526 transitions. Second operand has 5 states, 4 states have (on average 4.25) 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-20 10:56:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:19,714 INFO L93 Difference]: Finished difference Result 300 states and 658 transitions. [2022-11-20 10:56:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:56:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) 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-20 10:56:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:19,716 INFO L225 Difference]: With dead ends: 300 [2022-11-20 10:56:19,716 INFO L226 Difference]: Without dead ends: 210 [2022-11-20 10:56:19,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:56:19,717 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:19,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 7 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-20 10:56:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2022-11-20 10:56:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.2233009708737863) internal successors, (458), 206 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 458 transitions. [2022-11-20 10:56:19,725 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 458 transitions. Word has length 17 [2022-11-20 10:56:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:19,725 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 458 transitions. [2022-11-20 10:56:19,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) 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-20 10:56:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 458 transitions. [2022-11-20 10:56:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:56:19,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:19,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:19,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:56:19,727 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1098831240, now seen corresponding path program 3 times [2022-11-20 10:56:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:19,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190071055] [2022-11-20 10:56:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:20,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:20,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190071055] [2022-11-20 10:56:20,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190071055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:20,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:20,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:56:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5335864] [2022-11-20 10:56:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:20,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:56:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:20,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:56:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:56:20,015 INFO L87 Difference]: Start difference. First operand 207 states and 458 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-20 10:56:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:20,155 INFO L93 Difference]: Finished difference Result 186 states and 415 transitions. [2022-11-20 10:56:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:56:20,156 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-20 10:56:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:20,156 INFO L225 Difference]: With dead ends: 186 [2022-11-20 10:56:20,156 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 10:56:20,157 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-20 10:56:20,157 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:20,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 9 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 10:56:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-20 10:56:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2022-11-20 10:56:20,161 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 17 [2022-11-20 10:56:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:20,161 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2022-11-20 10:56:20,161 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-20 10:56:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2022-11-20 10:56:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:56:20,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:20,162 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-20 10:56:20,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:56:20,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1967391660, now seen corresponding path program 1 times [2022-11-20 10:56:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:20,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859459230] [2022-11-20 10:56:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859459230] [2022-11-20 10:56:21,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859459230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:21,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:21,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:56:21,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733047270] [2022-11-20 10:56:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:21,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:21,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:21,229 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:21,448 INFO L93 Difference]: Finished difference Result 156 states and 305 transitions. [2022-11-20 10:56:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:56:21,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 10:56:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:21,450 INFO L225 Difference]: With dead ends: 156 [2022-11-20 10:56:21,450 INFO L226 Difference]: Without dead ends: 125 [2022-11-20 10:56:21,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:56:21,451 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:21,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-20 10:56:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 100. [2022-11-20 10:56:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.01010101010101) internal successors, (199), 99 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 199 transitions. [2022-11-20 10:56:21,455 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 199 transitions. Word has length 21 [2022-11-20 10:56:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:21,457 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 199 transitions. [2022-11-20 10:56:21,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 199 transitions. [2022-11-20 10:56:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:56:21,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:21,459 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-20 10:56:21,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:56:21,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1692713944, now seen corresponding path program 2 times [2022-11-20 10:56:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:21,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37336574] [2022-11-20 10:56:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:22,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:22,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37336574] [2022-11-20 10:56:22,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37336574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:22,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:22,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:56:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555794663] [2022-11-20 10:56:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:22,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:56:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:56:22,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:56:22,389 INFO L87 Difference]: Start difference. First operand 100 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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-20 10:56:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:22,619 INFO L93 Difference]: Finished difference Result 135 states and 261 transitions. [2022-11-20 10:56:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:56:22,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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-20 10:56:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:22,621 INFO L225 Difference]: With dead ends: 135 [2022-11-20 10:56:22,621 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 10:56:22,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:56:22,622 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:22,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 17 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 10:56:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2022-11-20 10:56:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9275362318840579) internal successors, (133), 69 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2022-11-20 10:56:22,649 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 21 [2022-11-20 10:56:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:22,649 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2022-11-20 10:56:22,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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-20 10:56:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2022-11-20 10:56:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:56:22,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:22,650 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-20 10:56:22,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:56:22,650 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2103208354, now seen corresponding path program 3 times [2022-11-20 10:56:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:22,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192342359] [2022-11-20 10:56:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:22,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:56:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:22,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:56:22,855 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:56:22,857 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-20 10:56:22,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-20 10:56:22,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-20 10:56:22,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-20 10:56:22,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-20 10:56:22,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-20 10:56:22,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-20 10:56:22,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-20 10:56:22,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-20 10:56:22,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-20 10:56:22,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-20 10:56:22,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-20 10:56:22,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-20 10:56:22,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:56:22,868 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:22,875 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:56:22,875 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:56:23,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:56:23 BasicIcfg [2022-11-20 10:56:23,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:56:23,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:56:23,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:56:23,006 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:56:23,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:08" (3/4) ... [2022-11-20 10:56:23,009 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:56:23,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:56:23,011 INFO L158 Benchmark]: Toolchain (without parser) took 16473.04ms. Allocated memory was 136.3MB in the beginning and 237.0MB in the end (delta: 100.7MB). Free memory was 94.9MB in the beginning and 163.3MB in the end (delta: -68.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2022-11-20 10:56:23,011 INFO L158 Benchmark]: CDTParser took 1.75ms. Allocated memory is still 111.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:56:23,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.94ms. Allocated memory is still 136.3MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 10:56:23,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.18ms. Allocated memory is still 136.3MB. Free memory was 91.4MB in the beginning and 88.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:56:23,014 INFO L158 Benchmark]: Boogie Preprocessor took 33.16ms. Allocated memory is still 136.3MB. Free memory was 88.9MB in the beginning and 87.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:56:23,014 INFO L158 Benchmark]: RCFGBuilder took 893.27ms. Allocated memory is still 136.3MB. Free memory was 87.2MB in the beginning and 54.1MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 10:56:23,015 INFO L158 Benchmark]: TraceAbstraction took 14790.25ms. Allocated memory was 136.3MB in the beginning and 237.0MB in the end (delta: 100.7MB). Free memory was 53.2MB in the beginning and 163.3MB in the end (delta: -110.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:56:23,015 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 237.0MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:56:23,018 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.75ms. Allocated memory is still 111.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.94ms. Allocated memory is still 136.3MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.18ms. Allocated memory is still 136.3MB. Free memory was 91.4MB in the beginning and 88.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.16ms. Allocated memory is still 136.3MB. Free memory was 88.9MB in the beginning and 87.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 893.27ms. Allocated memory is still 136.3MB. Free memory was 87.2MB in the beginning and 54.1MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14790.25ms. Allocated memory was 136.3MB in the beginning and 237.0MB in the end (delta: 100.7MB). Free memory was 53.2MB in the beginning and 163.3MB in the end (delta: -110.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 237.0MB. Free memory is still 163.3MB. 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.3s, 137 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 33 TransitionsAfterwards, 2364 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 125 TotalNumberOfCompositions, 5987 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3076, independent: 2890, independent conditional: 0, independent unconditional: 2890, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1700, independent: 1639, independent conditional: 0, independent unconditional: 1639, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1700, independent: 1630, independent conditional: 0, independent unconditional: 1630, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 444, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 427, dependent conditional: 0, dependent unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3076, independent: 1251, independent conditional: 0, independent unconditional: 1251, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1700, unknown conditional: 0, unknown unconditional: 1700] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=7, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=8, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=9, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 z = 1 [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 846]: 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: 844]: 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, 157 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1001 IncrementalHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 38 mSDtfsCounter, 1001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 182 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 1215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 10:56:23,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:56:25,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:56:25,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:56:26,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:56:26,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:56:26,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:56:26,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:56:26,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:56:26,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:56:26,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:56:26,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:56:26,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:56:26,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:56:26,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:56:26,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:56:26,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:56:26,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:56:26,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:56:26,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:56:26,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:56:26,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:56:26,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:56:26,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:56:26,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:56:26,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:56:26,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:56:26,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:56:26,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:56:26,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:56:26,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:56:26,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:56:26,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:56:26,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:56:26,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:56:26,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:56:26,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:56:26,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:56:26,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:56:26,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:56:26,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:56:26,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:56:26,127 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 10:56:26,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:56:26,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:56:26,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:56:26,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:56:26,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:56:26,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:56:26,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:56:26,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:56:26,178 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:56:26,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:56:26,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:56:26,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:56:26,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:56:26,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:56:26,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:56:26,182 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:56:26,182 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:56:26,183 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:56:26,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:56:26,183 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:56:26,184 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:56:26,184 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:56:26,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:56:26,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:56:26,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:56:26,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:56:26,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:56:26,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:26,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:56:26,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:56:26,188 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:56:26,188 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:56:26,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:56:26,189 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_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2022-11-20 10:56:26,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:56:26,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:56:26,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:56:26,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:56:26,684 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:56:26,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-20 10:56:30,214 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:56:30,530 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:56:30,531 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-20 10:56:30,548 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data/5c4fcea0a/539c28d7a2a44309bcd27dee591f7aae/FLAG237ba6cba [2022-11-20 10:56:30,582 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/data/5c4fcea0a/539c28d7a2a44309bcd27dee591f7aae [2022-11-20 10:56:30,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:56:30,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:56:30,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:30,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:56:30,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:56:30,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:30" (1/1) ... [2022-11-20 10:56:30,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667d67c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:30, skipping insertion in model container [2022-11-20 10:56:30,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:30" (1/1) ... [2022-11-20 10:56:30,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:56:30,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:56:30,878 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_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-20 10:56:31,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:31,269 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:56:31,285 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_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-20 10:56:31,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:56:31,387 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:56:31,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31 WrapperNode [2022-11-20 10:56:31,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:56:31,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:31,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:56:31,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:56:31,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,515 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-20 10:56:31,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:56:31,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:56:31,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:56:31,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:56:31,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:56:31,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:56:31,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:56:31,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:56:31,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (1/1) ... [2022-11-20 10:56:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:56:31,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:31,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:56:31,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:56:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:56:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:56:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:56:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:56:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 10:56:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:56:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:56:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:56:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:56:31,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:56:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:56:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:56:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:56:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:56:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:56:31,690 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:56:31,924 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:56:31,926 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:56:32,481 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:56:32,699 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:56:32,700 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:56:32,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:32 BoogieIcfgContainer [2022-11-20 10:56:32,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:56:32,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:56:32,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:56:32,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:56:32,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:56:30" (1/3) ... [2022-11-20 10:56:32,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cb2ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:32, skipping insertion in model container [2022-11-20 10:56:32,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:31" (2/3) ... [2022-11-20 10:56:32,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cb2ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:56:32, skipping insertion in model container [2022-11-20 10:56:32,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:32" (3/3) ... [2022-11-20 10:56:32,730 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-11-20 10:56:32,754 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:56:32,754 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 10:56:32,755 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:56:32,920 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:56:32,976 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:56:33,018 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-20 10:56:33,022 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-20 10:56:33,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-20 10:56:33,136 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-20 10:56:33,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:56:33,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-20 10:56:33,148 INFO L119 LiptonReduction]: Number of co-enabled transitions 2364 [2022-11-20 10:56:44,262 INFO L134 LiptonReduction]: Checked pairs total: 5942 [2022-11-20 10:56:44,262 INFO L136 LiptonReduction]: Total number of compositions: 128 [2022-11-20 10:56:44,270 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-20 10:56:44,369 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1015 states have (on average 3.3300492610837438) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:44,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:56:44,395 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@589ae750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:56:44,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-20 10:56:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1015 states have (on average 3.3300492610837438) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:44,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:56:44,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:44,406 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:56:44,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash 547, now seen corresponding path program 1 times [2022-11-20 10:56:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:44,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778605330] [2022-11-20 10:56:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:44,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:44,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 10:56:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:44,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:56:44,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:44,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:44,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:44,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778605330] [2022-11-20 10:56:44,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778605330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:44,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:44,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:56:44,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863034112] [2022-11-20 10:56:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:56:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:44,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:56:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:56:44,554 INFO L87 Difference]: Start difference. First operand has 1028 states, 1015 states have (on average 3.3300492610837438) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:44,783 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-20 10:56:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:56:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 10:56:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:44,813 INFO L225 Difference]: With dead ends: 970 [2022-11-20 10:56:44,814 INFO L226 Difference]: Without dead ends: 970 [2022-11-20 10:56:44,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:56:44,818 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:44,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-20 10:56:44,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-20 10:56:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-20 10:56:45,022 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-20 10:56:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:45,023 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-20 10:56:45,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-20 10:56:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 10:56:45,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:45,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 10:56:45,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-20 10:56:45,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:45,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash 518130734, now seen corresponding path program 1 times [2022-11-20 10:56:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:45,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076581453] [2022-11-20 10:56:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:45,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:45,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:45,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 10:56:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:45,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:56:45,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:45,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:45,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:45,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076581453] [2022-11-20 10:56:45,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076581453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:45,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:45,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:56:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661065185] [2022-11-20 10:56:45,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:45,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:56:45,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:56:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:45,412 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:45,537 INFO L93 Difference]: Finished difference Result 794 states and 2496 transitions. [2022-11-20 10:56:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:56:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 10:56:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:45,547 INFO L225 Difference]: With dead ends: 794 [2022-11-20 10:56:45,547 INFO L226 Difference]: Without dead ends: 770 [2022-11-20 10:56:45,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:56:45,550 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:45,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-20 10:56:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-20 10:56:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 768 states have (on average 3.1692708333333335) internal successors, (2434), 769 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2434 transitions. [2022-11-20 10:56:45,597 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2434 transitions. Word has length 5 [2022-11-20 10:56:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:45,597 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2434 transitions. [2022-11-20 10:56:45,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2434 transitions. [2022-11-20 10:56:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:56:45,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:45,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:45,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:45,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:45,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:45,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 627711665, now seen corresponding path program 1 times [2022-11-20 10:56:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:45,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001774953] [2022-11-20 10:56:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:45,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:45,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:45,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 10:56:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:45,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:56:45,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:45,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:45,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:45,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001774953] [2022-11-20 10:56:45,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001774953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:45,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:45,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:45,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991891063] [2022-11-20 10:56:45,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:45,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:56:45,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:45,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:56:45,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:56:45,983 INFO L87 Difference]: Start difference. First operand 770 states and 2434 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:46,121 INFO L93 Difference]: Finished difference Result 590 states and 1580 transitions. [2022-11-20 10:56:46,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:56:46,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 10:56:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:46,125 INFO L225 Difference]: With dead ends: 590 [2022-11-20 10:56:46,125 INFO L226 Difference]: Without dead ends: 470 [2022-11-20 10:56:46,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:46,126 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:46,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-20 10:56:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-11-20 10:56:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 468 states have (on average 2.6367521367521367) internal successors, (1234), 469 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1234 transitions. [2022-11-20 10:56:46,176 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1234 transitions. Word has length 10 [2022-11-20 10:56:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:46,176 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1234 transitions. [2022-11-20 10:56:46,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1234 transitions. [2022-11-20 10:56:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:56:46,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:46,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:46,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:46,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:46,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1479337402, now seen corresponding path program 1 times [2022-11-20 10:56:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:46,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887528735] [2022-11-20 10:56:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:46,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:46,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:46,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:46,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 10:56:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:46,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:56:46,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:46,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:46,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:46,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887528735] [2022-11-20 10:56:46,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887528735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:46,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:46,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:56:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673896716] [2022-11-20 10:56:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:46,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:46,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:46,604 INFO L87 Difference]: Start difference. First operand 470 states and 1234 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-20 10:56:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:46,771 INFO L93 Difference]: Finished difference Result 295 states and 682 transitions. [2022-11-20 10:56:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:46,772 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-20 10:56:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:46,773 INFO L225 Difference]: With dead ends: 295 [2022-11-20 10:56:46,773 INFO L226 Difference]: Without dead ends: 235 [2022-11-20 10:56:46,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:56:46,774 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:46,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 15 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-20 10:56:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-11-20 10:56:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 233 states have (on average 2.2703862660944205) internal successors, (529), 234 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 529 transitions. [2022-11-20 10:56:46,783 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 529 transitions. Word has length 13 [2022-11-20 10:56:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:46,784 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 529 transitions. [2022-11-20 10:56:46,784 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-20 10:56:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 529 transitions. [2022-11-20 10:56:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:56:46,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:46,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:46,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:47,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:47,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 549974684, now seen corresponding path program 1 times [2022-11-20 10:56:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:47,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556073820] [2022-11-20 10:56:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:47,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:47,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 10:56:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:47,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:56:47,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:47,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:47,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:47,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556073820] [2022-11-20 10:56:47,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556073820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:47,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:47,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:56:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606779958] [2022-11-20 10:56:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:47,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:56:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:56:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:56:47,192 INFO L87 Difference]: Start difference. First operand 235 states and 529 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-20 10:56:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:47,396 INFO L93 Difference]: Finished difference Result 188 states and 433 transitions. [2022-11-20 10:56:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:56:47,396 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-20 10:56:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:47,397 INFO L225 Difference]: With dead ends: 188 [2022-11-20 10:56:47,397 INFO L226 Difference]: Without dead ends: 175 [2022-11-20 10:56:47,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:56:47,398 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:47,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 27 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-20 10:56:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-20 10:56:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 2.3641618497109826) internal successors, (409), 174 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 409 transitions. [2022-11-20 10:56:47,405 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 409 transitions. Word has length 17 [2022-11-20 10:56:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:47,406 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 409 transitions. [2022-11-20 10:56:47,406 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-20 10:56:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 409 transitions. [2022-11-20 10:56:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:56:47,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:47,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:47,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:47,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:47,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -489163364, now seen corresponding path program 1 times [2022-11-20 10:56:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:47,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129490897] [2022-11-20 10:56:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:47,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:47,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:47,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:47,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 10:56:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:47,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:56:47,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:48,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:48,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:48,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129490897] [2022-11-20 10:56:48,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129490897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:48,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:48,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:48,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127417926] [2022-11-20 10:56:48,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:48,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:48,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:48,283 INFO L87 Difference]: Start difference. First operand 175 states and 409 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:48,365 INFO L93 Difference]: Finished difference Result 283 states and 657 transitions. [2022-11-20 10:56:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:48,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-20 10:56:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:48,368 INFO L225 Difference]: With dead ends: 283 [2022-11-20 10:56:48,368 INFO L226 Difference]: Without dead ends: 283 [2022-11-20 10:56:48,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:48,369 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:48,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-11-20 10:56:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-20 10:56:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-11-20 10:56:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 281 states have (on average 2.3380782918149468) internal successors, (657), 282 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 657 transitions. [2022-11-20 10:56:48,380 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 657 transitions. Word has length 22 [2022-11-20 10:56:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:48,380 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 657 transitions. [2022-11-20 10:56:48,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 657 transitions. [2022-11-20 10:56:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:56:48,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:48,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:48,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:48,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:48,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:48,608 INFO L85 PathProgramCache]: Analyzing trace with hash -489163391, now seen corresponding path program 1 times [2022-11-20 10:56:48,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:48,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934462927] [2022-11-20 10:56:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:48,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:48,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:48,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:48,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 10:56:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:48,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:56:48,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:48,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:48,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:48,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934462927] [2022-11-20 10:56:48,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934462927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:48,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:48,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:56:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447748236] [2022-11-20 10:56:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:48,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:48,802 INFO L87 Difference]: Start difference. First operand 283 states and 657 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:48,975 INFO L93 Difference]: Finished difference Result 332 states and 756 transitions. [2022-11-20 10:56:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-20 10:56:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:48,977 INFO L225 Difference]: With dead ends: 332 [2022-11-20 10:56:48,977 INFO L226 Difference]: Without dead ends: 203 [2022-11-20 10:56:48,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:56:48,978 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:48,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 18 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:56:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-20 10:56:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2022-11-20 10:56:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.275) internal successors, (455), 201 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-20 10:56:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 455 transitions. [2022-11-20 10:56:48,997 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 455 transitions. Word has length 22 [2022-11-20 10:56:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:48,998 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 455 transitions. [2022-11-20 10:56:48,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 455 transitions. [2022-11-20 10:56:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:56:48,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:49,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:49,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:49,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:49,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1706746634, now seen corresponding path program 2 times [2022-11-20 10:56:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:49,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62599791] [2022-11-20 10:56:49,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:56:49,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:49,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:49,215 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:49,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-20 10:56:49,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:56:49,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:56:49,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:56:49,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:49,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:49,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:49,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62599791] [2022-11-20 10:56:49,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62599791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:49,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:49,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:56:49,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036073322] [2022-11-20 10:56:49,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:49,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:56:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:49,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:56:49,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:49,810 INFO L87 Difference]: Start difference. First operand 202 states and 455 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:49,863 INFO L93 Difference]: Finished difference Result 201 states and 453 transitions. [2022-11-20 10:56:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:56:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-20 10:56:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:49,865 INFO L225 Difference]: With dead ends: 201 [2022-11-20 10:56:49,865 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 10:56:49,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:56:49,866 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:49,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-11-20 10:56:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 10:56:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-20 10:56:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.0217391304347827) internal successors, (186), 92 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions. [2022-11-20 10:56:49,869 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 22 [2022-11-20 10:56:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:49,870 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 186 transitions. [2022-11-20 10:56:49,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2022-11-20 10:56:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:56:49,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:49,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:49,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:50,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:50,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1605382075, now seen corresponding path program 2 times [2022-11-20 10:56:50,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:50,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078690234] [2022-11-20 10:56:50,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:56:50,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:50,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:50,075 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:50,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 10:56:50,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:56:50,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:56:50,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:56:50,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:50,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:50,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:50,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078690234] [2022-11-20 10:56:50,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078690234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:50,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:50,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:56:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157205444] [2022-11-20 10:56:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:50,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:56:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:56:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:56:50,398 INFO L87 Difference]: Start difference. First operand 93 states and 186 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:50,682 INFO L93 Difference]: Finished difference Result 150 states and 289 transitions. [2022-11-20 10:56:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:56:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-20 10:56:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:50,684 INFO L225 Difference]: With dead ends: 150 [2022-11-20 10:56:50,684 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 10:56:50,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:56:50,685 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:50,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 31 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 10:56:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2022-11-20 10:56:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.0) internal successors, (200), 100 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 200 transitions. [2022-11-20 10:56:50,690 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 200 transitions. Word has length 22 [2022-11-20 10:56:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:50,692 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 200 transitions. [2022-11-20 10:56:50,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 200 transitions. [2022-11-20 10:56:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:56:50,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:50,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:50,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:50,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:50,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash 58254199, now seen corresponding path program 3 times [2022-11-20 10:56:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:50,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873241833] [2022-11-20 10:56:50,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:56:50,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:50,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:50,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:50,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-20 10:56:51,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 10:56:51,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:56:51,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:56:51,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:51,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:56:51,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:51,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873241833] [2022-11-20 10:56:51,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873241833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:51,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:51,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:56:51,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146926710] [2022-11-20 10:56:51,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:51,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:56:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:56:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:56:51,319 INFO L87 Difference]: Start difference. First operand 101 states and 200 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:51,601 INFO L93 Difference]: Finished difference Result 112 states and 215 transitions. [2022-11-20 10:56:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:56:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-20 10:56:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:51,607 INFO L225 Difference]: With dead ends: 112 [2022-11-20 10:56:51,607 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 10:56:51,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:56:51,608 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:51,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:56:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 10:56:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-11-20 10:56:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 70 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2022-11-20 10:56:51,615 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 22 [2022-11-20 10:56:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:51,615 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2022-11-20 10:56:51,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2022-11-20 10:56:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:56:51,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:51,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:51,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:51,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:51,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:56:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -35490009, now seen corresponding path program 4 times [2022-11-20 10:56:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:51,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153796345] [2022-11-20 10:56:51,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:56:51,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:51,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:51,833 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:51,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-20 10:56:51,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:56:51,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 10:56:51,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:56:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:52,145 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 10:56:52,146 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:56:52,147 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-20 10:56:52,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-20 10:56:52,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-20 10:56:52,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-20 10:56:52,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-20 10:56:52,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-20 10:56:52,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-20 10:56:52,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-20 10:56:52,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-20 10:56:52,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-20 10:56:52,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-20 10:56:52,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-20 10:56:52,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-20 10:56:52,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:52,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:52,370 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-11-20 10:56:52,375 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:56:52,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:56:52,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:56:52 BasicIcfg [2022-11-20 10:56:52,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:56:52,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:56:52,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:56:52,445 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:56:52,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:32" (3/4) ... [2022-11-20 10:56:52,448 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:56:52,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:56:52,449 INFO L158 Benchmark]: Toolchain (without parser) took 21862.19ms. Allocated memory was 60.8MB in the beginning and 151.0MB in the end (delta: 90.2MB). Free memory was 28.4MB in the beginning and 112.7MB in the end (delta: -84.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-11-20 10:56:52,449 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 60.8MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:56:52,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 797.02ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 28.2MB in the beginning and 45.1MB in the end (delta: -16.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-11-20 10:56:52,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.56ms. Allocated memory is still 86.0MB. Free memory was 45.1MB in the beginning and 64.0MB in the end (delta: -18.9MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-11-20 10:56:52,450 INFO L158 Benchmark]: Boogie Preprocessor took 51.39ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:56:52,451 INFO L158 Benchmark]: RCFGBuilder took 1133.77ms. Allocated memory is still 86.0MB. Free memory was 61.9MB in the beginning and 45.7MB in the end (delta: 16.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2022-11-20 10:56:52,451 INFO L158 Benchmark]: TraceAbstraction took 19724.88ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 44.9MB in the beginning and 112.7MB in the end (delta: -67.8MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2022-11-20 10:56:52,452 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 112.7MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:56:52,453 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.30ms. Allocated memory is still 60.8MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 797.02ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 28.2MB in the beginning and 45.1MB in the end (delta: -16.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.56ms. Allocated memory is still 86.0MB. Free memory was 45.1MB in the beginning and 64.0MB in the end (delta: -18.9MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.39ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1133.77ms. Allocated memory is still 86.0MB. Free memory was 61.9MB in the beginning and 45.7MB in the end (delta: 16.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19724.88ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 44.9MB in the beginning and 112.7MB in the end (delta: -67.8MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 112.7MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 138 PlacesBefore, 44 PlacesAfterwards, 130 TransitionsBefore, 35 TransitionsAfterwards, 2364 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 128 TotalNumberOfCompositions, 5942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3044, independent: 2879, independent conditional: 0, independent unconditional: 2879, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1672, independent: 1626, independent conditional: 0, independent unconditional: 1626, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1672, independent: 1618, independent conditional: 0, independent unconditional: 1618, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 427, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 406, dependent conditional: 0, dependent unconditional: 406, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3044, independent: 1253, independent conditional: 0, independent unconditional: 1253, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 1672, unknown conditional: 0, unknown unconditional: 1672] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=0, t916={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=1, t916={-6:0}, t917={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=2, t916={-6:0}, t917={-10:0}, t918={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={-6:0}, t917={-10:0}, t918={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={-6:0}, t917={-10:0}, t918={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 846]: 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: 844]: 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, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 54 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 890 IncrementalHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 52 mSDtfsCounter, 890 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 146 ConstructedInterpolants, 33 QuantifiedInterpolants, 1956 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1317 ConjunctsInSsa, 83 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-20 10:56:52,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b39d7ed6-93e4-484c-b9e3-b9dbcbccb763/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample