./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:09:44,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:09:44,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:09:44,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:09:44,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:09:44,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:09:44,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:09:44,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:09:44,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:09:44,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:09:44,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:09:44,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:09:44,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:09:44,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:09:44,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:09:44,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:09:44,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:09:44,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:09:44,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:09:44,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:09:44,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:09:44,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:09:44,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:09:44,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:09:44,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:09:44,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:09:44,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:09:44,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:09:44,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:09:44,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:09:44,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:09:44,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:09:44,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:09:44,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:09:44,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:09:44,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:09:44,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:09:44,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:09:44,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:09:44,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:09:44,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:09:44,239 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:09:44,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:09:44,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:09:44,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:09:44,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:09:44,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:09:44,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:09:44,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:09:44,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:09:44,297 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:09:44,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:09:44,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:09:44,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:09:44,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:09:44,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:09:44,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:09:44,300 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:09:44,301 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:09:44,301 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:09:44,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:09:44,302 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:09:44,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:09:44,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:09:44,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:09:44,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:09:44,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:09:44,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:09:44,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:09:44,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:09:44,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:09:44,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:09:44,306 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_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 [2022-11-16 11:09:44,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:09:44,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:09:44,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:09:44,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:09:44,684 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:09:44,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2022-11-16 11:09:44,759 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/f1e2a512b/9c98990fb62a4f3c92e69382074923e4/FLAGd8800dd33 [2022-11-16 11:09:45,427 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:09:45,427 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2022-11-16 11:09:45,454 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/f1e2a512b/9c98990fb62a4f3c92e69382074923e4/FLAGd8800dd33 [2022-11-16 11:09:45,659 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/f1e2a512b/9c98990fb62a4f3c92e69382074923e4 [2022-11-16 11:09:45,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:09:45,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:09:45,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:09:45,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:09:45,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:09:45,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:09:45" (1/1) ... [2022-11-16 11:09:45,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad403d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:45, skipping insertion in model container [2022-11-16 11:09:45,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:09:45" (1/1) ... [2022-11-16 11:09:45,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:09:45,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:09:45,949 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/sv-benchmarks/c/pthread-wmm/mix026.oepc.i[945,958] [2022-11-16 11:09:46,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:09:46,216 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:09:46,234 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/sv-benchmarks/c/pthread-wmm/mix026.oepc.i[945,958] [2022-11-16 11:09:46,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:09:46,364 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:09:46,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46 WrapperNode [2022-11-16 11:09:46,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:09:46,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:09:46,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:09:46,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:09:46,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,437 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-16 11:09:46,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:09:46,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:09:46,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:09:46,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:09:46,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,467 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:09:46,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:09:46,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:09:46,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:09:46,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (1/1) ... [2022-11-16 11:09:46,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:09:46,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:09:46,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:09:46,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:09:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:09:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:09:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:09:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:09:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:09:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:09:46,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:09:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:09:46,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:09:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:09:46,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:09:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:09:46,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:09:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:09:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:09:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:09:46,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:09:46,574 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:09:46,814 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:09:46,833 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:09:47,459 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:09:47,565 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:09:47,566 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:09:47,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:09:47 BoogieIcfgContainer [2022-11-16 11:09:47,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:09:47,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:09:47,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:09:47,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:09:47,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:09:45" (1/3) ... [2022-11-16 11:09:47,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3036b548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:09:47, skipping insertion in model container [2022-11-16 11:09:47,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:46" (2/3) ... [2022-11-16 11:09:47,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3036b548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:09:47, skipping insertion in model container [2022-11-16 11:09:47,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:09:47" (3/3) ... [2022-11-16 11:09:47,579 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2022-11-16 11:09:47,601 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:09:47,601 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-16 11:09:47,601 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:09:47,701 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:09:47,753 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:09:47,768 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-16 11:09:47,771 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-16 11:09:47,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-16 11:09:47,853 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-16 11:09:47,853 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:09:47,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-16 11:09:47,862 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-16 11:09:54,884 INFO L134 LiptonReduction]: Checked pairs total: 11019 [2022-11-16 11:09:54,884 INFO L136 LiptonReduction]: Total number of compositions: 137 [2022-11-16 11:09:54,897 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-16 11:09:55,291 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:55,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:09:55,328 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;@55326809, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:09:55,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-16 11:09:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:09:55,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:55,379 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:09:55,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:09:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 623, now seen corresponding path program 1 times [2022-11-16 11:09:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:55,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376481417] [2022-11-16 11:09:55,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:09:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:55,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376481417] [2022-11-16 11:09:55,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376481417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:55,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:55,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:09:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868793667] [2022-11-16 11:09:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:55,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:09:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:09:55,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:09:55,614 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:09:55,880 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-16 11:09:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:09:55,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 11:09:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:09:55,976 INFO L225 Difference]: With dead ends: 6074 [2022-11-16 11:09:55,976 INFO L226 Difference]: Without dead ends: 6074 [2022-11-16 11:09:55,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:09:55,980 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:09:55,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:09:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-16 11:09:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-16 11:09:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-16 11:09:56,482 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-16 11:09:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:09:56,483 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-16 11:09:56,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-16 11:09:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:09:56,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:56,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:09:56,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:09:56,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:09:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 612332, now seen corresponding path program 1 times [2022-11-16 11:09:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:56,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206608127] [2022-11-16 11:09:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:09:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:56,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206608127] [2022-11-16 11:09:56,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206608127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:56,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:56,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:09:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356112267] [2022-11-16 11:09:56,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:56,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:09:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:09:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:09:56,889 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:09:57,174 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-16 11:09:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:09:57,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 11:09:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:09:57,222 INFO L225 Difference]: With dead ends: 4962 [2022-11-16 11:09:57,229 INFO L226 Difference]: Without dead ends: 4812 [2022-11-16 11:09:57,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:09:57,232 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:09:57,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:09:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-16 11:09:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-16 11:09:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-16 11:09:57,547 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-16 11:09:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:09:57,556 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-16 11:09:57,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-16 11:09:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:09:57,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:57,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:09:57,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:09:57,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:09:57,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:57,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1351153856, now seen corresponding path program 1 times [2022-11-16 11:09:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:57,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998254003] [2022-11-16 11:09:57,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:57,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:09:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998254003] [2022-11-16 11:09:58,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998254003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:58,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:58,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:09:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149993474] [2022-11-16 11:09:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:58,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:09:58,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:58,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:09:58,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:09:58,092 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:09:58,457 INFO L93 Difference]: Finished difference Result 8130 states and 31752 transitions. [2022-11-16 11:09:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:09:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:09:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:09:58,514 INFO L225 Difference]: With dead ends: 8130 [2022-11-16 11:09:58,515 INFO L226 Difference]: Without dead ends: 8130 [2022-11-16 11:09:58,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:09:58,516 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:09:58,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:09:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2022-11-16 11:09:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6232. [2022-11-16 11:09:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 6230 states have (on average 4.0085072231139645) internal successors, (24973), 6231 states have internal predecessors, (24973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 24973 transitions. [2022-11-16 11:09:58,870 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 24973 transitions. Word has length 11 [2022-11-16 11:09:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:09:58,871 INFO L495 AbstractCegarLoop]: Abstraction has 6232 states and 24973 transitions. [2022-11-16 11:09:58,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 24973 transitions. [2022-11-16 11:09:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:09:58,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:58,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:09:58,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:09:58,881 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:09:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1066824414, now seen corresponding path program 1 times [2022-11-16 11:09:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:58,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742218617] [2022-11-16 11:09:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:09:59,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:59,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742218617] [2022-11-16 11:09:59,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742218617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:59,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:59,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:09:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649848074] [2022-11-16 11:09:59,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:59,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:09:59,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:09:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:09:59,220 INFO L87 Difference]: Start difference. First operand 6232 states and 24973 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:09:59,533 INFO L93 Difference]: Finished difference Result 7302 states and 28524 transitions. [2022-11-16 11:09:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:09:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:09:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:09:59,595 INFO L225 Difference]: With dead ends: 7302 [2022-11-16 11:09:59,595 INFO L226 Difference]: Without dead ends: 7302 [2022-11-16 11:09:59,595 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-16 11:09:59,599 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:09:59,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 10 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:09:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2022-11-16 11:09:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 5462. [2022-11-16 11:09:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5462 states, 5460 states have (on average 3.9954212454212454) internal successors, (21815), 5461 states have internal predecessors, (21815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 21815 transitions. [2022-11-16 11:09:59,938 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 21815 transitions. Word has length 12 [2022-11-16 11:09:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:09:59,938 INFO L495 AbstractCegarLoop]: Abstraction has 5462 states and 21815 transitions. [2022-11-16 11:09:59,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 21815 transitions. [2022-11-16 11:09:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:09:59,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:59,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:09:59,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:09:59,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:09:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1063902463, now seen corresponding path program 1 times [2022-11-16 11:09:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:59,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188390152] [2022-11-16 11:09:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:00,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188390152] [2022-11-16 11:10:00,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188390152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:00,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:00,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960426773] [2022-11-16 11:10:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:00,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:00,733 INFO L87 Difference]: Start difference. First operand 5462 states and 21815 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:01,195 INFO L93 Difference]: Finished difference Result 4712 states and 18640 transitions. [2022-11-16 11:10:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:01,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:10:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:01,220 INFO L225 Difference]: With dead ends: 4712 [2022-11-16 11:10:01,220 INFO L226 Difference]: Without dead ends: 3719 [2022-11-16 11:10:01,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:01,221 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:01,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 70 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:10:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-11-16 11:10:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3719. [2022-11-16 11:10:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3718 states have (on average 3.839160839160839) internal successors, (14274), 3718 states have internal predecessors, (14274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 14274 transitions. [2022-11-16 11:10:01,386 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 14274 transitions. Word has length 12 [2022-11-16 11:10:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:01,387 INFO L495 AbstractCegarLoop]: Abstraction has 3719 states and 14274 transitions. [2022-11-16 11:10:01,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 14274 transitions. [2022-11-16 11:10:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:10:01,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:01,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:01,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:10:01,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1288178047, now seen corresponding path program 1 times [2022-11-16 11:10:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:01,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411094348] [2022-11-16 11:10:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:01,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411094348] [2022-11-16 11:10:01,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411094348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:01,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:01,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138749631] [2022-11-16 11:10:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:01,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:01,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:01,674 INFO L87 Difference]: Start difference. First operand 3719 states and 14274 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:01,887 INFO L93 Difference]: Finished difference Result 3696 states and 12817 transitions. [2022-11-16 11:10:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:10:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 11:10:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:01,902 INFO L225 Difference]: With dead ends: 3696 [2022-11-16 11:10:01,902 INFO L226 Difference]: Without dead ends: 2727 [2022-11-16 11:10:01,902 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-16 11:10:01,903 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:01,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 20 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2022-11-16 11:10:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2727. [2022-11-16 11:10:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 3.4225972120322816) internal successors, (9330), 2726 states have internal predecessors, (9330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 9330 transitions. [2022-11-16 11:10:02,009 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 9330 transitions. Word has length 13 [2022-11-16 11:10:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:02,010 INFO L495 AbstractCegarLoop]: Abstraction has 2727 states and 9330 transitions. [2022-11-16 11:10:02,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 9330 transitions. [2022-11-16 11:10:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:10:02,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:02,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:02,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:10:02,015 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:02,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1999839453, now seen corresponding path program 1 times [2022-11-16 11:10:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:02,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400436809] [2022-11-16 11:10:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:02,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:02,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400436809] [2022-11-16 11:10:02,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400436809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:02,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:02,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:02,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932086036] [2022-11-16 11:10:02,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:02,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:10:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:02,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:10:02,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:02,383 INFO L87 Difference]: Start difference. First operand 2727 states and 9330 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:02,605 INFO L93 Difference]: Finished difference Result 2288 states and 7217 transitions. [2022-11-16 11:10:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:10:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:10:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:02,613 INFO L225 Difference]: With dead ends: 2288 [2022-11-16 11:10:02,613 INFO L226 Difference]: Without dead ends: 1719 [2022-11-16 11:10:02,613 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-16 11:10:02,614 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:02,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 28 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2022-11-16 11:10:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1707. [2022-11-16 11:10:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 3.093786635404455) internal successors, (5278), 1706 states have internal predecessors, (5278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 5278 transitions. [2022-11-16 11:10:02,699 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 5278 transitions. Word has length 16 [2022-11-16 11:10:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:02,700 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 5278 transitions. [2022-11-16 11:10:02,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 5278 transitions. [2022-11-16 11:10:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:10:02,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:02,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:02,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:10:02,706 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 779488288, now seen corresponding path program 1 times [2022-11-16 11:10:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:02,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041629123] [2022-11-16 11:10:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:03,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041629123] [2022-11-16 11:10:03,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041629123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:03,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:03,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196207431] [2022-11-16 11:10:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:03,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:10:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:03,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:10:03,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:03,362 INFO L87 Difference]: Start difference. First operand 1707 states and 5278 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:03,717 INFO L93 Difference]: Finished difference Result 3027 states and 9139 transitions. [2022-11-16 11:10:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:10:03,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:10:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:03,730 INFO L225 Difference]: With dead ends: 3027 [2022-11-16 11:10:03,730 INFO L226 Difference]: Without dead ends: 2665 [2022-11-16 11:10:03,731 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-16 11:10:03,731 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:03,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 40 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:10:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2022-11-16 11:10:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2108. [2022-11-16 11:10:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 3.0669197911722827) internal successors, (6462), 2107 states have internal predecessors, (6462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 6462 transitions. [2022-11-16 11:10:03,816 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 6462 transitions. Word has length 20 [2022-11-16 11:10:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:03,817 INFO L495 AbstractCegarLoop]: Abstraction has 2108 states and 6462 transitions. [2022-11-16 11:10:03,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 6462 transitions. [2022-11-16 11:10:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:10:03,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:03,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:03,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:10:03,825 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:03,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2000165058, now seen corresponding path program 2 times [2022-11-16 11:10:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:03,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055675834] [2022-11-16 11:10:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:04,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:04,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055675834] [2022-11-16 11:10:04,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055675834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:04,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:04,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001926903] [2022-11-16 11:10:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:04,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:10:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:10:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:10:04,195 INFO L87 Difference]: Start difference. First operand 2108 states and 6462 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:04,491 INFO L93 Difference]: Finished difference Result 1891 states and 5741 transitions. [2022-11-16 11:10:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:10:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:04,502 INFO L225 Difference]: With dead ends: 1891 [2022-11-16 11:10:04,502 INFO L226 Difference]: Without dead ends: 1684 [2022-11-16 11:10:04,502 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-16 11:10:04,504 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:04,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 31 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:10:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-11-16 11:10:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1604. [2022-11-16 11:10:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 3.0748596381784155) internal successors, (4929), 1603 states have internal predecessors, (4929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 4929 transitions. [2022-11-16 11:10:04,568 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 4929 transitions. Word has length 20 [2022-11-16 11:10:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:04,569 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 4929 transitions. [2022-11-16 11:10:04,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 4929 transitions. [2022-11-16 11:10:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:10:04,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:04,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:04,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:10:04,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash 287520830, now seen corresponding path program 1 times [2022-11-16 11:10:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:04,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344771595] [2022-11-16 11:10:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:06,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:06,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344771595] [2022-11-16 11:10:06,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344771595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:06,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:06,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:06,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391239677] [2022-11-16 11:10:06,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:06,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:06,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:06,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:06,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:06,072 INFO L87 Difference]: Start difference. First operand 1604 states and 4929 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:06,565 INFO L93 Difference]: Finished difference Result 2143 states and 6422 transitions. [2022-11-16 11:10:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:06,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 11:10:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:06,574 INFO L225 Difference]: With dead ends: 2143 [2022-11-16 11:10:06,575 INFO L226 Difference]: Without dead ends: 2056 [2022-11-16 11:10:06,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:10:06,576 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:06,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 41 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:10:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2022-11-16 11:10:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1462. [2022-11-16 11:10:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1461 states have (on average 3.0691307323750854) internal successors, (4484), 1461 states have internal predecessors, (4484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 4484 transitions. [2022-11-16 11:10:06,634 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 4484 transitions. Word has length 24 [2022-11-16 11:10:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:06,636 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 4484 transitions. [2022-11-16 11:10:06,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 4484 transitions. [2022-11-16 11:10:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:10:06,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:06,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:06,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:10:06,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:06,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash -626571964, now seen corresponding path program 2 times [2022-11-16 11:10:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:06,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964856344] [2022-11-16 11:10:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:07,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964856344] [2022-11-16 11:10:07,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964856344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:07,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:07,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:10:07,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711603376] [2022-11-16 11:10:07,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:07,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:07,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:07,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:07,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:07,102 INFO L87 Difference]: Start difference. First operand 1462 states and 4484 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:07,365 INFO L93 Difference]: Finished difference Result 1426 states and 4408 transitions. [2022-11-16 11:10:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:10:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 11:10:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:07,372 INFO L225 Difference]: With dead ends: 1426 [2022-11-16 11:10:07,372 INFO L226 Difference]: Without dead ends: 1246 [2022-11-16 11:10:07,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:10:07,373 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 125 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:07,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 25 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-11-16 11:10:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1111. [2022-11-16 11:10:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 3.1297297297297297) internal successors, (3474), 1110 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3474 transitions. [2022-11-16 11:10:07,420 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3474 transitions. Word has length 24 [2022-11-16 11:10:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:07,421 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 3474 transitions. [2022-11-16 11:10:07,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3474 transitions. [2022-11-16 11:10:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:07,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:07,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:07,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:10:07,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash -391543213, now seen corresponding path program 1 times [2022-11-16 11:10:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:07,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813067507] [2022-11-16 11:10:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:07,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:07,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813067507] [2022-11-16 11:10:07,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813067507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:07,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:07,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:07,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477685350] [2022-11-16 11:10:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:07,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:07,774 INFO L87 Difference]: Start difference. First operand 1111 states and 3474 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:07,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:07,948 INFO L93 Difference]: Finished difference Result 1626 states and 5015 transitions. [2022-11-16 11:10:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:10:07,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:07,952 INFO L225 Difference]: With dead ends: 1626 [2022-11-16 11:10:07,953 INFO L226 Difference]: Without dead ends: 733 [2022-11-16 11:10:07,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:07,954 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:07,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:10:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-11-16 11:10:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2022-11-16 11:10:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 2.942622950819672) internal successors, (2154), 732 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 2154 transitions. [2022-11-16 11:10:07,982 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 2154 transitions. Word has length 28 [2022-11-16 11:10:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:07,983 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 2154 transitions. [2022-11-16 11:10:07,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 2154 transitions. [2022-11-16 11:10:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:07,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:07,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:07,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:10:07,990 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:07,991 INFO L85 PathProgramCache]: Analyzing trace with hash 905459529, now seen corresponding path program 2 times [2022-11-16 11:10:07,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:07,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337088371] [2022-11-16 11:10:07,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:07,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:08,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:08,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337088371] [2022-11-16 11:10:08,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337088371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:08,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:08,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766303491] [2022-11-16 11:10:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:08,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:08,249 INFO L87 Difference]: Start difference. First operand 733 states and 2154 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:08,358 INFO L93 Difference]: Finished difference Result 984 states and 2874 transitions. [2022-11-16 11:10:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:08,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:08,361 INFO L225 Difference]: With dead ends: 984 [2022-11-16 11:10:08,361 INFO L226 Difference]: Without dead ends: 605 [2022-11-16 11:10:08,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:08,362 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:08,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:10:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-16 11:10:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2022-11-16 11:10:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 2.890728476821192) internal successors, (1746), 604 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1746 transitions. [2022-11-16 11:10:08,383 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1746 transitions. Word has length 28 [2022-11-16 11:10:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:08,383 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 1746 transitions. [2022-11-16 11:10:08,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1746 transitions. [2022-11-16 11:10:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:08,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:08,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:08,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:10:08,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -195180535, now seen corresponding path program 3 times [2022-11-16 11:10:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:08,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244672796] [2022-11-16 11:10:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244672796] [2022-11-16 11:10:09,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244672796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:09,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:09,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210944900] [2022-11-16 11:10:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:09,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:09,435 INFO L87 Difference]: Start difference. First operand 605 states and 1746 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:09,843 INFO L93 Difference]: Finished difference Result 958 states and 2694 transitions. [2022-11-16 11:10:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:10:09,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:09,847 INFO L225 Difference]: With dead ends: 958 [2022-11-16 11:10:09,847 INFO L226 Difference]: Without dead ends: 758 [2022-11-16 11:10:09,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:10:09,848 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:09,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 38 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:10:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-11-16 11:10:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 607. [2022-11-16 11:10:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 2.8514851485148514) internal successors, (1728), 606 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1728 transitions. [2022-11-16 11:10:09,868 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1728 transitions. Word has length 28 [2022-11-16 11:10:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:09,868 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 1728 transitions. [2022-11-16 11:10:09,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1728 transitions. [2022-11-16 11:10:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:09,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:09,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:09,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:10:09,872 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1277733317, now seen corresponding path program 4 times [2022-11-16 11:10:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267670842] [2022-11-16 11:10:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:10,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:10,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267670842] [2022-11-16 11:10:10,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267670842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:10,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:10,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:10,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207315398] [2022-11-16 11:10:10,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:10,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:10,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:10,733 INFO L87 Difference]: Start difference. First operand 607 states and 1728 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:11,167 INFO L93 Difference]: Finished difference Result 882 states and 2453 transitions. [2022-11-16 11:10:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:11,172 INFO L225 Difference]: With dead ends: 882 [2022-11-16 11:10:11,172 INFO L226 Difference]: Without dead ends: 796 [2022-11-16 11:10:11,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:10:11,173 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:11,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 33 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:10:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-11-16 11:10:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 607. [2022-11-16 11:10:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 2.844884488448845) internal successors, (1724), 606 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1724 transitions. [2022-11-16 11:10:11,194 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1724 transitions. Word has length 28 [2022-11-16 11:10:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:11,194 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 1724 transitions. [2022-11-16 11:10:11,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1724 transitions. [2022-11-16 11:10:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:11,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:11,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:11,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:10:11,198 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 642273561, now seen corresponding path program 5 times [2022-11-16 11:10:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:11,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442141234] [2022-11-16 11:10:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:12,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442141234] [2022-11-16 11:10:12,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442141234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:12,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:12,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:10:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816032498] [2022-11-16 11:10:12,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:12,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:10:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:10:12,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:10:12,842 INFO L87 Difference]: Start difference. First operand 607 states and 1724 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:13,345 INFO L93 Difference]: Finished difference Result 782 states and 2177 transitions. [2022-11-16 11:10:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:13,348 INFO L225 Difference]: With dead ends: 782 [2022-11-16 11:10:13,348 INFO L226 Difference]: Without dead ends: 696 [2022-11-16 11:10:13,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:10:13,349 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:13,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 50 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:10:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-16 11:10:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 527. [2022-11-16 11:10:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 2.8098859315589353) internal successors, (1478), 526 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1478 transitions. [2022-11-16 11:10:13,364 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1478 transitions. Word has length 28 [2022-11-16 11:10:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:13,365 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 1478 transitions. [2022-11-16 11:10:13,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1478 transitions. [2022-11-16 11:10:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:13,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:13,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:13,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:10:13,368 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:13,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1386034289, now seen corresponding path program 6 times [2022-11-16 11:10:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513885111] [2022-11-16 11:10:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:10:13,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:10:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:10:13,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:10:13,609 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:10:13,610 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-16 11:10:13,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-16 11:10:13,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-16 11:10:13,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-16 11:10:13,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-16 11:10:13,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-16 11:10:13,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-16 11:10:13,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-16 11:10:13,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-16 11:10:13,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-16 11:10:13,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-16 11:10:13,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-16 11:10:13,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-16 11:10:13,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-16 11:10:13,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-16 11:10:13,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-16 11:10:13,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:10:13,619 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:13,627 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:10:13,627 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:10:13,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:10:13 BasicIcfg [2022-11-16 11:10:13,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:10:13,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:10:13,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:10:13,747 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:10:13,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:09:47" (3/4) ... [2022-11-16 11:10:13,750 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:10:13,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:10:13,751 INFO L158 Benchmark]: Toolchain (without parser) took 28088.12ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 63.4MB in the beginning and 537.6MB in the end (delta: -474.2MB). Peak memory consumption was 547.7MB. Max. memory is 16.1GB. [2022-11-16 11:10:13,752 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 100.7MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:10:13,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.32ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 62.7MB in the end (delta: 534.3kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:10:13,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.39ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 59.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:13,753 INFO L158 Benchmark]: Boogie Preprocessor took 34.35ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 58.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:13,753 INFO L158 Benchmark]: RCFGBuilder took 1094.87ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 57.9MB in the beginning and 87.3MB in the end (delta: -29.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-11-16 11:10:13,753 INFO L158 Benchmark]: TraceAbstraction took 26174.83ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 86.7MB in the beginning and 538.7MB in the end (delta: -452.0MB). Peak memory consumption was 538.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:13,754 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 1.1GB. Free memory is still 537.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:10:13,755 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.28ms. Allocated memory is still 100.7MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.32ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 62.7MB in the end (delta: 534.3kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.39ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 59.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.35ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 58.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.87ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 57.9MB in the beginning and 87.3MB in the end (delta: -29.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26174.83ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 86.7MB in the beginning and 538.7MB in the end (delta: -452.0MB). Peak memory consumption was 538.1MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 1.1GB. Free memory is still 537.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 161 PlacesBefore, 57 PlacesAfterwards, 150 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 11019 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5649, independent: 5407, independent conditional: 0, independent unconditional: 5407, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2877, independent: 2788, independent conditional: 0, independent unconditional: 2788, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2877, independent: 2754, independent conditional: 0, independent unconditional: 2754, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 123, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 622, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 562, dependent conditional: 0, dependent unconditional: 562, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5649, independent: 2619, independent conditional: 0, independent unconditional: 2619, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 2877, unknown conditional: 0, unknown unconditional: 2877] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 355, Positive conditional cache size: 0, Positive unconditional cache size: 355, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L738] 0 _Bool a$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L712] 0 int __unbuffered_p0_EAX = 0; [L722] 0 int a$mem_tmp; [L733] 0 _Bool a$read_delayed; [L714] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$r_buff1_thd1; [L735] 0 int a$w_buff0; [L730] 0 _Bool a$r_buff1_thd2; [L737] 0 int a$w_buff1; [L721] 0 _Bool a$flush_delayed; [L728] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L734] 0 int *a$read_delayed_var; [L740] 0 _Bool main$tmp_guard1; [L739] 0 _Bool main$tmp_guard0; [L736] 0 _Bool a$w_buff0_used; [L724] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EAX = 0; [L726] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd4; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t681, ((void *)0), P0, ((void *)0))=-2, t681={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t682, ((void *)0), P1, ((void *)0))=-1, t681={5:0}, t682={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t683; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t683, ((void *)0), P2, ((void *)0))=0, t681={5:0}, t682={6:0}, t683={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t684, ((void *)0), P3, ((void *)0))=1, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2588 IncrementalHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 124 mSDtfsCounter, 2588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 5625 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 3234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 11:10:13,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:10:16,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:10:16,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:10:16,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:10:16,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:10:16,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:10:16,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:10:16,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:10:16,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:10:16,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:10:16,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:10:16,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:10:16,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:10:16,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:10:16,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:10:16,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:10:16,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:10:16,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:10:16,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:10:16,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:10:16,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:10:16,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:10:16,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:10:16,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:10:16,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:10:16,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:10:16,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:10:16,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:10:16,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:10:16,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:10:16,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:10:16,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:10:16,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:10:16,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:10:16,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:10:16,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:10:16,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:10:16,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:10:16,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:10:16,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:10:16,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:10:16,476 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:10:16,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:10:16,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:10:16,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:10:16,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:10:16,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:10:16,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:10:16,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:10:16,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:10:16,517 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:10:16,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:10:16,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:10:16,519 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:10:16,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:10:16,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:10:16,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:10:16,520 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:10:16,520 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:10:16,520 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:10:16,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:10:16,521 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:10:16,521 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:10:16,521 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:10:16,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:10:16,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:10:16,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:10:16,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:10:16,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:10:16,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:10:16,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:10:16,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:10:16,524 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:10:16,524 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:10:16,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:10:16,525 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_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 [2022-11-16 11:10:16,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:10:16,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:10:17,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:10:17,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:10:17,004 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:10:17,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2022-11-16 11:10:17,102 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/3b06f1215/24808ff9eebf43069879d74897d2bebb/FLAGff2edadba [2022-11-16 11:10:17,801 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:10:17,802 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2022-11-16 11:10:17,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/3b06f1215/24808ff9eebf43069879d74897d2bebb/FLAGff2edadba [2022-11-16 11:10:18,039 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/data/3b06f1215/24808ff9eebf43069879d74897d2bebb [2022-11-16 11:10:18,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:10:18,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:10:18,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:10:18,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:10:18,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:10:18,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:10:18" (1/1) ... [2022-11-16 11:10:18,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11850d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:18, skipping insertion in model container [2022-11-16 11:10:18,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:10:18" (1/1) ... [2022-11-16 11:10:18,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:10:18,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:10:18,372 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/sv-benchmarks/c/pthread-wmm/mix026.oepc.i[945,958] [2022-11-16 11:10:18,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:10:18,816 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:10:18,837 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/sv-benchmarks/c/pthread-wmm/mix026.oepc.i[945,958] [2022-11-16 11:10:18,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:10:19,007 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:10:19,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19 WrapperNode [2022-11-16 11:10:19,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:10:19,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:10:19,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:10:19,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:10:19,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,088 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-16 11:10:19,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:10:19,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:10:19,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:10:19,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:10:19,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,129 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:10:19,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:10:19,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:10:19,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:10:19,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (1/1) ... [2022-11-16 11:10:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:10:19,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:10:19,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:10:19,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:10:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:10:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:10:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:10:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:10:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:10:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:10:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:10:19,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:10:19,271 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:10:19,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:10:19,271 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:10:19,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:10:19,272 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:10:19,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:10:19,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:10:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:10:19,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:10:19,275 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:10:19,550 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:10:19,553 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:10:20,185 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:10:20,342 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:10:20,343 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:10:20,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:10:20 BoogieIcfgContainer [2022-11-16 11:10:20,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:10:20,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:10:20,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:10:20,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:10:20,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:10:18" (1/3) ... [2022-11-16 11:10:20,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c5074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:10:20, skipping insertion in model container [2022-11-16 11:10:20,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:19" (2/3) ... [2022-11-16 11:10:20,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c5074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:10:20, skipping insertion in model container [2022-11-16 11:10:20,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:10:20" (3/3) ... [2022-11-16 11:10:20,356 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2022-11-16 11:10:20,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:10:20,378 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-16 11:10:20,378 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:10:20,470 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:10:20,507 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:10:20,525 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 151 transitions, 322 flow [2022-11-16 11:10:20,534 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 151 transitions, 322 flow [2022-11-16 11:10:20,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-16 11:10:20,650 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-16 11:10:20,650 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:10:20,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-16 11:10:20,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-16 11:10:32,477 INFO L134 LiptonReduction]: Checked pairs total: 10955 [2022-11-16 11:10:32,478 INFO L136 LiptonReduction]: Total number of compositions: 144 [2022-11-16 11:10:32,487 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-16 11:10:32,938 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:32,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:10:32,973 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;@2955f45f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:10:32,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-16 11:10:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:10:33,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:33,008 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:10:33,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash 630, now seen corresponding path program 1 times [2022-11-16 11:10:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:33,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257748052] [2022-11-16 11:10:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:33,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:33,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:33,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:33,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:10:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:33,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:10:33,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:33,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:33,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257748052] [2022-11-16 11:10:33,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257748052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:33,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:33,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:10:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867792863] [2022-11-16 11:10:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:33,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:10:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:33,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:10:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:10:33,269 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:33,928 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-16 11:10:33,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:10:33,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 11:10:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:34,046 INFO L225 Difference]: With dead ends: 6074 [2022-11-16 11:10:34,046 INFO L226 Difference]: Without dead ends: 6074 [2022-11-16 11:10:34,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:10:34,055 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:34,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:10:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-16 11:10:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-16 11:10:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-16 11:10:34,742 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-16 11:10:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:34,742 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-16 11:10:34,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-16 11:10:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:10:34,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:34,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:10:34,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:34,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:34,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 621047, now seen corresponding path program 1 times [2022-11-16 11:10:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:34,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169702064] [2022-11-16 11:10:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:34,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:34,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:34,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:34,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:10:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:35,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:10:35,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:35,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:35,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:35,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169702064] [2022-11-16 11:10:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169702064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:35,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:35,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:10:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241067040] [2022-11-16 11:10:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:35,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:35,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:35,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:35,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:35,209 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:35,482 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-16 11:10:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 11:10:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:35,592 INFO L225 Difference]: With dead ends: 4962 [2022-11-16 11:10:35,593 INFO L226 Difference]: Without dead ends: 4812 [2022-11-16 11:10:35,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:35,594 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:35,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-16 11:10:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-16 11:10:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-16 11:10:36,138 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-16 11:10:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:36,139 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-16 11:10:36,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-16 11:10:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:10:36,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:36,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:36,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:36,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:36,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:36,358 INFO L85 PathProgramCache]: Analyzing trace with hash -234812715, now seen corresponding path program 1 times [2022-11-16 11:10:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:36,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024218197] [2022-11-16 11:10:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:36,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:36,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:36,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:36,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:10:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:36,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:10:36,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:36,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:36,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024218197] [2022-11-16 11:10:36,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024218197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:36,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:36,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179042286] [2022-11-16 11:10:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:36,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:36,618 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 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-16 11:10:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:37,014 INFO L93 Difference]: Finished difference Result 3962 states and 14045 transitions. [2022-11-16 11:10:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:10:37,015 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-16 11:10:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:37,086 INFO L225 Difference]: With dead ends: 3962 [2022-11-16 11:10:37,089 INFO L226 Difference]: Without dead ends: 3212 [2022-11-16 11:10:37,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:37,090 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:37,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 20 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:10:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-11-16 11:10:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2022-11-16 11:10:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3210 states have (on average 3.520249221183801) internal successors, (11300), 3211 states have internal predecessors, (11300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 11300 transitions. [2022-11-16 11:10:37,221 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 11300 transitions. Word has length 11 [2022-11-16 11:10:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:37,222 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 11300 transitions. [2022-11-16 11:10:37,222 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-16 11:10:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 11300 transitions. [2022-11-16 11:10:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:10:37,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:37,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:37,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:37,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:37,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash -607907465, now seen corresponding path program 1 times [2022-11-16 11:10:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:37,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444501076] [2022-11-16 11:10:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:37,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:37,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:37,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:37,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:10:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:37,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:10:37,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:37,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:37,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:37,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444501076] [2022-11-16 11:10:37,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444501076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:37,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:37,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806732579] [2022-11-16 11:10:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:37,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:10:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:10:37,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:37,679 INFO L87 Difference]: Start difference. First operand 3212 states and 11300 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:37,999 INFO L93 Difference]: Finished difference Result 2122 states and 6669 transitions. [2022-11-16 11:10:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:10:38,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 11:10:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:38,009 INFO L225 Difference]: With dead ends: 2122 [2022-11-16 11:10:38,009 INFO L226 Difference]: Without dead ends: 1692 [2022-11-16 11:10:38,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-16 11:10:38,011 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:38,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 36 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:10:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-11-16 11:10:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2022-11-16 11:10:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 3.088757396449704) internal successors, (5220), 1691 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5220 transitions. [2022-11-16 11:10:38,074 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5220 transitions. Word has length 15 [2022-11-16 11:10:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:38,075 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5220 transitions. [2022-11-16 11:10:38,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5220 transitions. [2022-11-16 11:10:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:10:38,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:38,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:38,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-16 11:10:38,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:38,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1988573882, now seen corresponding path program 1 times [2022-11-16 11:10:38,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:38,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727408701] [2022-11-16 11:10:38,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:38,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:38,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:38,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:38,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:10:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:38,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:10:38,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:38,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:38,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:38,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727408701] [2022-11-16 11:10:38,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727408701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:38,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:38,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:38,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894730563] [2022-11-16 11:10:38,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:38,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:10:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:10:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:10:38,677 INFO L87 Difference]: Start difference. First operand 1692 states and 5220 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:39,219 INFO L93 Difference]: Finished difference Result 1278 states and 3941 transitions. [2022-11-16 11:10:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:39,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-16 11:10:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:39,230 INFO L225 Difference]: With dead ends: 1278 [2022-11-16 11:10:39,230 INFO L226 Difference]: Without dead ends: 1152 [2022-11-16 11:10:39,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:39,232 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:39,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 64 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:10:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-16 11:10:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-16 11:10:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.130434782608696) internal successors, (3600), 1151 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3600 transitions. [2022-11-16 11:10:39,285 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3600 transitions. Word has length 19 [2022-11-16 11:10:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:39,285 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3600 transitions. [2022-11-16 11:10:39,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3600 transitions. [2022-11-16 11:10:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:10:39,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:39,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:39,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:39,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:39,510 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1183805269, now seen corresponding path program 1 times [2022-11-16 11:10:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:39,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408289622] [2022-11-16 11:10:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:39,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:39,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:39,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:39,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:10:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:39,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:10:39,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:39,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:39,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408289622] [2022-11-16 11:10:39,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408289622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:39,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:39,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:10:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906287370] [2022-11-16 11:10:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:39,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:39,800 INFO L87 Difference]: Start difference. First operand 1152 states and 3600 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:40,461 INFO L93 Difference]: Finished difference Result 1085 states and 3464 transitions. [2022-11-16 11:10:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:10:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 11:10:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:40,468 INFO L225 Difference]: With dead ends: 1085 [2022-11-16 11:10:40,468 INFO L226 Difference]: Without dead ends: 1067 [2022-11-16 11:10:40,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:10:40,470 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:40,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 96 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:10:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-16 11:10:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2022-11-16 11:10:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 3.220657276995305) internal successors, (3430), 1066 states have internal predecessors, (3430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3430 transitions. [2022-11-16 11:10:40,526 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3430 transitions. Word has length 23 [2022-11-16 11:10:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:40,527 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3430 transitions. [2022-11-16 11:10:40,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3430 transitions. [2022-11-16 11:10:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:40,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:40,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:40,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:40,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:40,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash -734464793, now seen corresponding path program 1 times [2022-11-16 11:10:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:40,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282929228] [2022-11-16 11:10:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:40,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:40,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:40,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:40,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 11:10:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:40,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:10:40,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:41,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:41,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:41,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282929228] [2022-11-16 11:10:41,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282929228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:41,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:41,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441977277] [2022-11-16 11:10:41,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:41,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:41,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:41,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:41,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:41,051 INFO L87 Difference]: Start difference. First operand 1067 states and 3430 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:41,320 INFO L93 Difference]: Finished difference Result 1575 states and 4976 transitions. [2022-11-16 11:10:41,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:10:41,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:41,332 INFO L225 Difference]: With dead ends: 1575 [2022-11-16 11:10:41,332 INFO L226 Difference]: Without dead ends: 1575 [2022-11-16 11:10:41,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:41,334 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:41,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-11-16 11:10:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1573. [2022-11-16 11:10:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1571 states have (on average 3.166772756206238) internal successors, (4975), 1572 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 4975 transitions. [2022-11-16 11:10:41,421 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 4975 transitions. Word has length 28 [2022-11-16 11:10:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:41,422 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 4975 transitions. [2022-11-16 11:10:41,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 4975 transitions. [2022-11-16 11:10:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:41,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:41,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:41,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:41,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash 131521925, now seen corresponding path program 2 times [2022-11-16 11:10:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:41,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554333357] [2022-11-16 11:10:41,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:10:41,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:41,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:41,667 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:41,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 11:10:41,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:10:41,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:10:41,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:10:41,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:42,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:42,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:42,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554333357] [2022-11-16 11:10:42,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554333357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:42,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:42,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181041760] [2022-11-16 11:10:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:42,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:42,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:42,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:42,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:42,172 INFO L87 Difference]: Start difference. First operand 1573 states and 4975 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:42,667 INFO L93 Difference]: Finished difference Result 2247 states and 6847 transitions. [2022-11-16 11:10:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:42,677 INFO L225 Difference]: With dead ends: 2247 [2022-11-16 11:10:42,677 INFO L226 Difference]: Without dead ends: 2247 [2022-11-16 11:10:42,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:10:42,678 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:42,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 47 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:10:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-11-16 11:10:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1603. [2022-11-16 11:10:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1601 states have (on average 3.1630231105559026) internal successors, (5064), 1602 states have internal predecessors, (5064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 5064 transitions. [2022-11-16 11:10:42,734 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 5064 transitions. Word has length 28 [2022-11-16 11:10:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:42,734 INFO L495 AbstractCegarLoop]: Abstraction has 1603 states and 5064 transitions. [2022-11-16 11:10:42,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 5064 transitions. [2022-11-16 11:10:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:42,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:42,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:42,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:42,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:42,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1341110249, now seen corresponding path program 3 times [2022-11-16 11:10:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:42,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413178939] [2022-11-16 11:10:42,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:10:42,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:42,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:42,957 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:43,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 11:10:43,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:10:43,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:10:43,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:10:43,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:43,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:43,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413178939] [2022-11-16 11:10:43,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413178939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:43,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:43,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:43,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43285782] [2022-11-16 11:10:43,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:43,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:43,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:43,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:43,180 INFO L87 Difference]: Start difference. First operand 1603 states and 5064 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:43,387 INFO L93 Difference]: Finished difference Result 2377 states and 7407 transitions. [2022-11-16 11:10:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:10:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:43,400 INFO L225 Difference]: With dead ends: 2377 [2022-11-16 11:10:43,400 INFO L226 Difference]: Without dead ends: 2377 [2022-11-16 11:10:43,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:43,402 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:43,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 16 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-11-16 11:10:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1483. [2022-11-16 11:10:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1481 states have (on average 3.1586765698852126) internal successors, (4678), 1482 states have internal predecessors, (4678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 4678 transitions. [2022-11-16 11:10:43,485 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 4678 transitions. Word has length 28 [2022-11-16 11:10:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:43,485 INFO L495 AbstractCegarLoop]: Abstraction has 1483 states and 4678 transitions. [2022-11-16 11:10:43,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 4678 transitions. [2022-11-16 11:10:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:43,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:43,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:43,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:43,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:43,709 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:43,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash 696717523, now seen corresponding path program 4 times [2022-11-16 11:10:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:43,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748239361] [2022-11-16 11:10:43,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:10:43,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:43,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:43,712 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:43,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 11:10:43,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:10:43,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:10:43,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:10:43,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:43,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:43,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:43,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748239361] [2022-11-16 11:10:43,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748239361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:43,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:43,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:43,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799664622] [2022-11-16 11:10:43,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:43,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:43,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:43,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:43,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:43,933 INFO L87 Difference]: Start difference. First operand 1483 states and 4678 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:44,105 INFO L93 Difference]: Finished difference Result 1999 states and 6213 transitions. [2022-11-16 11:10:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:44,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:44,117 INFO L225 Difference]: With dead ends: 1999 [2022-11-16 11:10:44,117 INFO L226 Difference]: Without dead ends: 1999 [2022-11-16 11:10:44,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:44,119 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:44,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2022-11-16 11:10:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1372. [2022-11-16 11:10:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1370 states have (on average 3.156934306569343) internal successors, (4325), 1371 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 4325 transitions. [2022-11-16 11:10:44,185 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 4325 transitions. Word has length 28 [2022-11-16 11:10:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:44,185 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 4325 transitions. [2022-11-16 11:10:44,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 4325 transitions. [2022-11-16 11:10:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:44,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:44,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:44,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:44,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:44,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:44,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash 750112785, now seen corresponding path program 5 times [2022-11-16 11:10:44,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:44,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81358729] [2022-11-16 11:10:44,407 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:10:44,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:44,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:44,409 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:44,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 11:10:44,636 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:10:44,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:10:44,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 11:10:44,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:45,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:45,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:10:45,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81358729] [2022-11-16 11:10:45,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81358729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:45,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:45,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:10:45,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366667087] [2022-11-16 11:10:45,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:45,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:10:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:10:45,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:10:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:10:45,253 INFO L87 Difference]: Start difference. First operand 1372 states and 4325 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:45,691 INFO L93 Difference]: Finished difference Result 1564 states and 4831 transitions. [2022-11-16 11:10:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 11:10:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:45,698 INFO L225 Difference]: With dead ends: 1564 [2022-11-16 11:10:45,698 INFO L226 Difference]: Without dead ends: 1564 [2022-11-16 11:10:45,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:10:45,699 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:45,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 37 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:10:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2022-11-16 11:10:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1224. [2022-11-16 11:10:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1222 states have (on average 3.190671031096563) internal successors, (3899), 1223 states have internal predecessors, (3899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3899 transitions. [2022-11-16 11:10:45,740 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3899 transitions. Word has length 28 [2022-11-16 11:10:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:45,741 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 3899 transitions. [2022-11-16 11:10:45,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:10:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3899 transitions. [2022-11-16 11:10:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:10:45,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:45,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:45,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:45,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:45,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 11:10:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1518345609, now seen corresponding path program 6 times [2022-11-16 11:10:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:10:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858502734] [2022-11-16 11:10:45,960 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:10:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:10:45,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:10:45,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 11:10:46,192 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-16 11:10:46,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:10:46,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:10:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:10:46,406 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:10:46,407 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:10:46,408 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-16 11:10:46,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-16 11:10:46,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-16 11:10:46,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-16 11:10:46,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-16 11:10:46,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-16 11:10:46,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-16 11:10:46,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-16 11:10:46,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-16 11:10:46,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-16 11:10:46,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-16 11:10:46,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-16 11:10:46,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-16 11:10:46,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-16 11:10:46,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-16 11:10:46,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-16 11:10:46,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:10:46,631 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:46,635 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:10:46,635 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:10:46,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:10:46 BasicIcfg [2022-11-16 11:10:46,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:10:46,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:10:46,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:10:46,786 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:10:46,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:10:20" (3/4) ... [2022-11-16 11:10:46,790 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:10:46,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:10:46,791 INFO L158 Benchmark]: Toolchain (without parser) took 28746.45ms. Allocated memory was 67.1MB in the beginning and 562.0MB in the end (delta: 494.9MB). Free memory was 48.1MB in the beginning and 458.1MB in the end (delta: -409.9MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:46,791 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 67.1MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:10:46,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 962.83ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 37.1MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:10:46,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.38ms. Allocated memory is still 67.1MB. Free memory was 36.9MB in the beginning and 34.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:46,792 INFO L158 Benchmark]: Boogie Preprocessor took 47.06ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 32.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:46,793 INFO L158 Benchmark]: RCFGBuilder took 1208.02ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.1MB in the beginning and 53.7MB in the end (delta: -21.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-11-16 11:10:46,794 INFO L158 Benchmark]: TraceAbstraction took 26437.41ms. Allocated memory was 88.1MB in the beginning and 562.0MB in the end (delta: 474.0MB). Free memory was 52.8MB in the beginning and 458.1MB in the end (delta: -405.3MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2022-11-16 11:10:46,794 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 562.0MB. Free memory is still 458.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:10:46,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 67.1MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 962.83ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 37.1MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.38ms. Allocated memory is still 67.1MB. Free memory was 36.9MB in the beginning and 34.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.06ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 32.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1208.02ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.1MB in the beginning and 53.7MB in the end (delta: -21.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26437.41ms. Allocated memory was 88.1MB in the beginning and 562.0MB in the end (delta: 474.0MB). Free memory was 52.8MB in the beginning and 458.1MB in the end (delta: -405.3MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 562.0MB. Free memory is still 458.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9s, 162 PlacesBefore, 57 PlacesAfterwards, 151 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 10955 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5483, independent: 5244, independent conditional: 0, independent unconditional: 5244, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2865, independent: 2781, independent conditional: 0, independent unconditional: 2781, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2865, independent: 2751, independent conditional: 0, independent unconditional: 2751, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 114, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 646, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 566, dependent conditional: 0, dependent unconditional: 566, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5483, independent: 2463, independent conditional: 0, independent unconditional: 2463, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 2865, unknown conditional: 0, unknown unconditional: 2865] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 349, Positive conditional cache size: 0, Positive unconditional cache size: 349, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L738] 0 _Bool a$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L712] 0 int __unbuffered_p0_EAX = 0; [L722] 0 int a$mem_tmp; [L733] 0 _Bool a$read_delayed; [L714] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$r_buff1_thd1; [L735] 0 int a$w_buff0; [L730] 0 _Bool a$r_buff1_thd2; [L737] 0 int a$w_buff1; [L721] 0 _Bool a$flush_delayed; [L728] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L734] 0 int *a$read_delayed_var; [L740] 0 _Bool main$tmp_guard1; [L739] 0 _Bool main$tmp_guard0; [L736] 0 _Bool a$w_buff0_used; [L724] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EAX = 0; [L726] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd4; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t681, ((void *)0), P0, ((void *)0))=-1, t681={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t682, ((void *)0), P1, ((void *)0))=0, t681={3:0}, t682={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t683, ((void *)0), P2, ((void *)0))=1, t681={3:0}, t682={7:0}, t683={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t684, ((void *)0), P3, ((void *)0))=2, t681={3:0}, t682={7:0}, t683={11:0}, t684={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L805] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681={3:0}, t682={7:0}, t683={11:0}, t684={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 529 mSDsluCounter, 352 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1914 IncrementalHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 112 mSDtfsCounter, 1914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1099 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1700 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 11:10:46,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b180562d-4675-49ff-bce9-4d849d6d9623/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample