./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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_852b5962-e28b-48af-8370-dd68d6813de1/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 ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 --- 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:55:05,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:55:05,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:55:05,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:55:05,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:55:05,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:55:05,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:55:05,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:55:05,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:55:05,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:55:05,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:55:05,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:55:05,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:55:05,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:55:05,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:55:05,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:55:05,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:55:05,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:55:05,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:55:05,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:55:05,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:55:05,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:55:05,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:55:05,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:55:05,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:55:05,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:55:05,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:55:05,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:55:05,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:55:05,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:55:05,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:55:05,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:55:05,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:55:05,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:55:05,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:55:05,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:55:05,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:55:05,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:55:05,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:55:05,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:55:05,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:55:05,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:55:05,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:55:05,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:55:05,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:55:05,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:55:05,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:55:05,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:55:05,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:55:05,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:55:05,458 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:55:05,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:55:05,459 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:55:05,460 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:55:05,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:55:05,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:55:05,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:55:05,460 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:55:05,461 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:55:05,461 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:55:05,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:55:05,461 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:55:05,461 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:55:05,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:55:05,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:55:05,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:55:05,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:55:05,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:55:05,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:55:05,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:55:05,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:55:05,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:55:05,466 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_852b5962-e28b-48af-8370-dd68d6813de1/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_852b5962-e28b-48af-8370-dd68d6813de1/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 -> ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 [2022-11-16 11:55:05,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:55:05,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:55:05,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:55:05,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:55:05,845 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:55:05,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:55:05,926 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/dc4d96191/73e7a1a43c35408aa0e7860617b9b2d7/FLAG9b5ee3a7f [2022-11-16 11:55:06,525 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:55:06,526 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:55:06,540 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/dc4d96191/73e7a1a43c35408aa0e7860617b9b2d7/FLAG9b5ee3a7f [2022-11-16 11:55:06,828 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/dc4d96191/73e7a1a43c35408aa0e7860617b9b2d7 [2022-11-16 11:55:06,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:55:06,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:55:06,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:55:06,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:55:06,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:55:06,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:55:06" (1/1) ... [2022-11-16 11:55:06,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d9e628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:06, skipping insertion in model container [2022-11-16 11:55:06,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:55:06" (1/1) ... [2022-11-16 11:55:06,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:55:06,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:55:07,145 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_852b5962-e28b-48af-8370-dd68d6813de1/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-16 11:55:07,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:55:07,462 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:55:07,476 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_852b5962-e28b-48af-8370-dd68d6813de1/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-16 11:55:07,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:55:07,571 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:55:07,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07 WrapperNode [2022-11-16 11:55:07,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:55:07,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:55:07,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:55:07,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:55:07,584 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:55:07" (1/1) ... [2022-11-16 11:55:07,617 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:55:07" (1/1) ... [2022-11-16 11:55:07,665 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-16 11:55:07,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:55:07,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:55:07,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:55:07,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:55:07,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,714 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:55:07,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:55:07,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:55:07,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:55:07,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (1/1) ... [2022-11-16 11:55:07,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:55:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:07,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:55:07,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:55:07,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:55:07,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:55:07,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:55:07,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:55:07,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:55:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:55:07,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:55:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:55:07,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:55:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:55:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:55:07,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:55:07,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:55:07,831 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:55:08,012 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:55:08,015 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:55:08,407 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:55:08,599 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:55:08,599 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:55:08,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:55:08 BoogieIcfgContainer [2022-11-16 11:55:08,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:55:08,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:55:08,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:55:08,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:55:08,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:55:06" (1/3) ... [2022-11-16 11:55:08,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f090b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:55:08, skipping insertion in model container [2022-11-16 11:55:08,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:07" (2/3) ... [2022-11-16 11:55:08,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f090b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:55:08, skipping insertion in model container [2022-11-16 11:55:08,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:55:08" (3/3) ... [2022-11-16 11:55:08,615 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:55:08,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:55:08,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 11:55:08,634 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:55:08,734 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:55:08,803 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:55:08,818 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 220 flow [2022-11-16 11:55:08,821 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 220 flow [2022-11-16 11:55:08,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 220 flow [2022-11-16 11:55:08,879 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-11-16 11:55:08,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:55:08,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-16 11:55:08,890 INFO L119 LiptonReduction]: Number of co-enabled transitions 1422 [2022-11-16 11:55:14,169 INFO L134 LiptonReduction]: Checked pairs total: 3837 [2022-11-16 11:55:14,169 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-11-16 11:55:14,183 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 66 flow [2022-11-16 11:55:14,236 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:55:14,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:55:14,266 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;@262e24b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:55:14,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 11:55:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:55:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:55:14,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:14,275 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:55:14,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash 471, now seen corresponding path program 1 times [2022-11-16 11:55:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:14,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307240447] [2022-11-16 11:55:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:14,424 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:55:14,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:14,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307240447] [2022-11-16 11:55:14,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307240447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:14,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:14,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:55:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094848415] [2022-11-16 11:55:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:14,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:55:14,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:55:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:55:14,466 INFO L87 Difference]: Start difference. First operand has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 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:55:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:14,559 INFO L93 Difference]: Finished difference Result 262 states and 645 transitions. [2022-11-16 11:55:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:55:14,562 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:55:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:14,574 INFO L225 Difference]: With dead ends: 262 [2022-11-16 11:55:14,574 INFO L226 Difference]: Without dead ends: 262 [2022-11-16 11:55:14,575 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:55:14,578 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:14,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:55:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-16 11:55:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-16 11:55:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 2.509727626459144) internal successors, (645), 261 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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:55:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 645 transitions. [2022-11-16 11:55:14,636 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 645 transitions. Word has length 1 [2022-11-16 11:55:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:14,636 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 645 transitions. [2022-11-16 11:55:14,636 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:55:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 645 transitions. [2022-11-16 11:55:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:55:14,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:14,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:55:14,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:55:14,638 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash 446232715, now seen corresponding path program 1 times [2022-11-16 11:55:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:14,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887051275] [2022-11-16 11:55:14,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:15,060 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:55:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:15,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887051275] [2022-11-16 11:55:15,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887051275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:15,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:15,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:55:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823539318] [2022-11-16 11:55:15,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:15,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:55:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:15,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:55:15,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:55:15,067 INFO L87 Difference]: Start difference. First operand 262 states and 645 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:15,156 INFO L93 Difference]: Finished difference Result 227 states and 552 transitions. [2022-11-16 11:55:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:55:15,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:55:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:15,162 INFO L225 Difference]: With dead ends: 227 [2022-11-16 11:55:15,163 INFO L226 Difference]: Without dead ends: 222 [2022-11-16 11:55:15,163 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:55:15,164 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:15,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-16 11:55:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-11-16 11:55:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 2.4681818181818183) internal successors, (543), 221 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:55:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 543 transitions. [2022-11-16 11:55:15,185 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 543 transitions. Word has length 5 [2022-11-16 11:55:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:15,186 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 543 transitions. [2022-11-16 11:55:15,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 543 transitions. [2022-11-16 11:55:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:55:15,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:15,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:15,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:55:15,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash 796758769, now seen corresponding path program 1 times [2022-11-16 11:55:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:15,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649464651] [2022-11-16 11:55:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:15,647 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:55:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:15,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649464651] [2022-11-16 11:55:15,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649464651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:15,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:15,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:55:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47361778] [2022-11-16 11:55:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:15,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:15,656 INFO L87 Difference]: Start difference. First operand 222 states and 543 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:55:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:15,722 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2022-11-16 11:55:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:55:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 11:55:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:15,726 INFO L225 Difference]: With dead ends: 187 [2022-11-16 11:55:15,726 INFO L226 Difference]: Without dead ends: 187 [2022-11-16 11:55:15,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:15,730 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:15,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-16 11:55:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-11-16 11:55:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.4193548387096775) internal successors, (450), 186 states have internal predecessors, (450), 0 states have call successors, (0), 0 states 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:55:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 450 transitions. [2022-11-16 11:55:15,749 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 450 transitions. Word has length 8 [2022-11-16 11:55:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:15,750 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 450 transitions. [2022-11-16 11:55:15,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:55:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 450 transitions. [2022-11-16 11:55:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:55:15,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:15,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:15,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:55:15,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 796758754, now seen corresponding path program 1 times [2022-11-16 11:55:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:15,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585512722] [2022-11-16 11:55:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:16,300 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:55:16,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:16,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585512722] [2022-11-16 11:55:16,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585512722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:16,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:16,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:55:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405171488] [2022-11-16 11:55:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:16,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:55:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:55:16,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:55:16,303 INFO L87 Difference]: Start difference. First operand 187 states and 450 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:55:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:16,575 INFO L93 Difference]: Finished difference Result 236 states and 548 transitions. [2022-11-16 11:55:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:55:16,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 11:55:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:16,579 INFO L225 Difference]: With dead ends: 236 [2022-11-16 11:55:16,579 INFO L226 Difference]: Without dead ends: 193 [2022-11-16 11:55:16,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:55:16,581 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:16,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 11 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:55:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-16 11:55:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 167. [2022-11-16 11:55:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.3132530120481927) internal successors, (384), 166 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:55:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 384 transitions. [2022-11-16 11:55:16,592 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 384 transitions. Word has length 8 [2022-11-16 11:55:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:16,593 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 384 transitions. [2022-11-16 11:55:16,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:55:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 384 transitions. [2022-11-16 11:55:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:55:16,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:16,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:16,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:55:16,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash 572039299, now seen corresponding path program 1 times [2022-11-16 11:55:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:16,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033247126] [2022-11-16 11:55:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:16,793 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:55:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:16,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033247126] [2022-11-16 11:55:16,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033247126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:16,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:16,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:55:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797844871] [2022-11-16 11:55:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:16,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:16,796 INFO L87 Difference]: Start difference. First operand 167 states and 384 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:16,906 INFO L93 Difference]: Finished difference Result 263 states and 584 transitions. [2022-11-16 11:55:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:55:16,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:55:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:16,908 INFO L225 Difference]: With dead ends: 263 [2022-11-16 11:55:16,908 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 11:55:16,909 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:55:16,910 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:16,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 9 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 11:55:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-11-16 11:55:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.2419354838709675) internal successors, (278), 124 states have internal predecessors, (278), 0 states have call successors, (0), 0 states 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:55:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 278 transitions. [2022-11-16 11:55:16,915 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 278 transitions. Word has length 11 [2022-11-16 11:55:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:16,915 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 278 transitions. [2022-11-16 11:55:16,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 278 transitions. [2022-11-16 11:55:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:55:16,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:16,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:16,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:55:16,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 771433065, now seen corresponding path program 1 times [2022-11-16 11:55:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725113837] [2022-11-16 11:55:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:16,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:17,162 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:55:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:17,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725113837] [2022-11-16 11:55:17,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725113837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:17,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:17,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:55:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564048962] [2022-11-16 11:55:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:17,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:17,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:17,166 INFO L87 Difference]: Start difference. First operand 125 states and 278 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:55:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:17,260 INFO L93 Difference]: Finished difference Result 133 states and 284 transitions. [2022-11-16 11:55:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:55:17,261 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:55:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:17,262 INFO L225 Difference]: With dead ends: 133 [2022-11-16 11:55:17,262 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 11:55:17,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:55:17,263 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:17,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 11:55:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2022-11-16 11:55:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.2232142857142856) internal successors, (249), 112 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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:55:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 249 transitions. [2022-11-16 11:55:17,276 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 249 transitions. Word has length 12 [2022-11-16 11:55:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:17,277 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 249 transitions. [2022-11-16 11:55:17,277 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:55:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 249 transitions. [2022-11-16 11:55:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:55:17,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:17,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:17,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:55:17,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1856779166, now seen corresponding path program 1 times [2022-11-16 11:55:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:17,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787801565] [2022-11-16 11:55:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:17,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:17,812 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:55:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787801565] [2022-11-16 11:55:17,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787801565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:17,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:17,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:55:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472648247] [2022-11-16 11:55:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:55:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:55:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:55:17,818 INFO L87 Difference]: Start difference. First operand 113 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:17,962 INFO L93 Difference]: Finished difference Result 121 states and 256 transitions. [2022-11-16 11:55:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:55:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 11:55:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:17,965 INFO L225 Difference]: With dead ends: 121 [2022-11-16 11:55:17,965 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 11:55:17,966 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:55:17,966 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:17,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 11:55:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-11-16 11:55:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.19811320754717) internal successors, (233), 106 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:55:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 233 transitions. [2022-11-16 11:55:17,971 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 233 transitions. Word has length 13 [2022-11-16 11:55:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:17,972 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 233 transitions. [2022-11-16 11:55:17,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 233 transitions. [2022-11-16 11:55:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:55:17,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:17,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:17,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:55:17,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1683618422, now seen corresponding path program 1 times [2022-11-16 11:55:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:17,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032352911] [2022-11-16 11:55:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:18,403 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:55:18,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:18,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032352911] [2022-11-16 11:55:18,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032352911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:18,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:55:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880447328] [2022-11-16 11:55:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:18,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:55:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:18,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:55:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:55:18,405 INFO L87 Difference]: Start difference. First operand 107 states and 233 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:18,760 INFO L93 Difference]: Finished difference Result 168 states and 366 transitions. [2022-11-16 11:55:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:55:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:55:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:18,764 INFO L225 Difference]: With dead ends: 168 [2022-11-16 11:55:18,764 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 11:55:18,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:55:18,765 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:18,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:55:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 11:55:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-11-16 11:55:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.075) internal successors, (166), 80 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:55:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 166 transitions. [2022-11-16 11:55:18,768 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 166 transitions. Word has length 14 [2022-11-16 11:55:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:18,768 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 166 transitions. [2022-11-16 11:55:18,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 166 transitions. [2022-11-16 11:55:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:55:18,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:18,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:18,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:55:18,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1725623732, now seen corresponding path program 2 times [2022-11-16 11:55:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:18,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087779603] [2022-11-16 11:55:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:19,055 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:55:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:19,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087779603] [2022-11-16 11:55:19,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087779603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:19,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:19,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:55:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030935134] [2022-11-16 11:55:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:19,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:19,059 INFO L87 Difference]: Start difference. First operand 81 states and 166 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:19,123 INFO L93 Difference]: Finished difference Result 98 states and 189 transitions. [2022-11-16 11:55:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:55:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:55:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:19,125 INFO L225 Difference]: With dead ends: 98 [2022-11-16 11:55:19,125 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 11:55:19,125 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:55:19,126 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:19,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 11:55:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-16 11:55:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.076923076923077) internal successors, (162), 78 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:55:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 162 transitions. [2022-11-16 11:55:19,129 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 162 transitions. Word has length 14 [2022-11-16 11:55:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:19,129 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 162 transitions. [2022-11-16 11:55:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 162 transitions. [2022-11-16 11:55:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:55:19,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:19,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:19,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:55:19,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1329728076, now seen corresponding path program 3 times [2022-11-16 11:55:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:19,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101086625] [2022-11-16 11:55:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:19,361 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:55:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101086625] [2022-11-16 11:55:19,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101086625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:19,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:19,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:55:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348247287] [2022-11-16 11:55:19,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:19,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:19,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:19,364 INFO L87 Difference]: Start difference. First operand 79 states and 162 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:19,437 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2022-11-16 11:55:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:55:19,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:55:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:19,438 INFO L225 Difference]: With dead ends: 67 [2022-11-16 11:55:19,438 INFO L226 Difference]: Without dead ends: 49 [2022-11-16 11:55:19,438 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:55:19,439 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:19,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-16 11:55:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-16 11:55:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.625) internal successors, (78), 48 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:55:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2022-11-16 11:55:19,442 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 14 [2022-11-16 11:55:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:19,442 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2022-11-16 11:55:19,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2022-11-16 11:55:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:55:19,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:19,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:19,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:55:19,446 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1742325632, now seen corresponding path program 1 times [2022-11-16 11:55:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:19,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687528366] [2022-11-16 11:55:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:19,718 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:55:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:19,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687528366] [2022-11-16 11:55:19,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687528366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:19,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:19,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:55:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231456292] [2022-11-16 11:55:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:19,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:55:19,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:19,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:55:19,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:55:19,721 INFO L87 Difference]: Start difference. First operand 49 states and 78 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:55:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:19,796 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-11-16 11:55:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:55:19,797 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:55:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:19,797 INFO L225 Difference]: With dead ends: 34 [2022-11-16 11:55:19,797 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 11:55:19,798 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:55:19,798 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:19,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 11 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 11:55:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-16 11:55:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:55:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-16 11:55:19,800 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-11-16 11:55:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:19,800 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-16 11:55:19,800 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:55:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-16 11:55:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:19,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:19,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:19,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:55:19,801 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 328384661, now seen corresponding path program 1 times [2022-11-16 11:55:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:19,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874671792] [2022-11-16 11:55:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:20,734 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:55:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:20,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874671792] [2022-11-16 11:55:20,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874671792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:20,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:20,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:55:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055862612] [2022-11-16 11:55:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:20,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:55:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:55:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:55:20,736 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:20,935 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-16 11:55:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:55:20,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:55:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:20,936 INFO L225 Difference]: With dead ends: 36 [2022-11-16 11:55:20,936 INFO L226 Difference]: Without dead ends: 23 [2022-11-16 11:55:20,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:55:20,937 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:20,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-16 11:55:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-16 11:55:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:55:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-16 11:55:20,939 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-11-16 11:55:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:20,940 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-16 11:55:20,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-16 11:55:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:20,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:20,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:20,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:55:20,941 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash -707511143, now seen corresponding path program 2 times [2022-11-16 11:55:20,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:20,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967236600] [2022-11-16 11:55:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:55:20,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:55:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:55:21,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:55:21,091 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:55:21,092 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 11:55:21,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 11:55:21,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 11:55:21,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 11:55:21,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 11:55:21,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 11:55:21,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 11:55:21,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 11:55:21,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 11:55:21,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 11:55:21,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:55:21,106 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:21,112 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:55:21,113 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:55:21,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:55:21 BasicIcfg [2022-11-16 11:55:21,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:55:21,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:55:21,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:55:21,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:55:21,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:55:08" (3/4) ... [2022-11-16 11:55:21,207 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:55:21,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:55:21,208 INFO L158 Benchmark]: Toolchain (without parser) took 14373.37ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 84.0MB in the beginning and 218.8MB in the end (delta: -134.8MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2022-11-16 11:55:21,208 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:55:21,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 733.60ms. Allocated memory is still 125.8MB. Free memory was 83.8MB in the beginning and 86.5MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:55:21,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.11ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:55:21,209 INFO L158 Benchmark]: Boogie Preprocessor took 63.56ms. Allocated memory is still 125.8MB. Free memory was 83.8MB in the beginning and 82.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:55:21,210 INFO L158 Benchmark]: RCFGBuilder took 871.47ms. Allocated memory is still 125.8MB. Free memory was 82.3MB in the beginning and 50.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 11:55:21,211 INFO L158 Benchmark]: TraceAbstraction took 12596.12ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 50.3MB in the beginning and 219.9MB in the end (delta: -169.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:55:21,211 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 268.4MB. Free memory is still 218.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:55:21,212 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 125.8MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 733.60ms. Allocated memory is still 125.8MB. Free memory was 83.8MB in the beginning and 86.5MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.11ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.56ms. Allocated memory is still 125.8MB. Free memory was 83.8MB in the beginning and 82.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 871.47ms. Allocated memory is still 125.8MB. Free memory was 82.3MB in the beginning and 50.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12596.12ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 50.3MB in the beginning and 219.9MB in the end (delta: -169.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 268.4MB. Free memory is still 218.8MB. 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: 5.3s, 110 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 1422 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 3837 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2250, independent: 2113, independent conditional: 0, independent unconditional: 2113, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1101, independent: 1054, independent conditional: 0, independent unconditional: 1054, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1101, independent: 1034, independent conditional: 0, independent unconditional: 1034, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 558, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 519, dependent conditional: 0, dependent unconditional: 519, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2250, independent: 1059, independent conditional: 0, independent unconditional: 1059, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 1101, unknown conditional: 0, unknown unconditional: 1101] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L717] 0 _Bool x$flush_delayed; [L726] 0 int *x$read_delayed_var; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L718] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd1; [L710] 0 int __unbuffered_p1_EAX = 0; [L721] 0 _Bool x$r_buff0_thd2; [L719] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L714] 0 _Bool main$tmp_guard1; [L730] 0 _Bool x$w_buff1_used; [L713] 0 _Bool main$tmp_guard0; [L712] 0 int __unbuffered_p1_EBX = 0; [L728] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff0; [L729] 0 int x$w_buff1; [L716] 0 int x = 0; [L723] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd0; [L732] 0 int y = 0; [L724] 0 _Bool x$r_buff1_thd2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=-1, t1587={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 798]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 801]: 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: 803]: 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 5 procedures, 125 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 697 IncrementalHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 65 mSDtfsCounter, 697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 11:55:21,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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_852b5962-e28b-48af-8370-dd68d6813de1/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 ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 --- 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:55:23,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:55:23,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:55:23,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:55:23,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:55:23,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:55:23,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:55:23,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:55:23,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:55:23,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:55:23,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:55:23,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:55:23,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:55:23,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:55:23,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:55:23,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:55:23,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:55:23,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:55:23,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:55:23,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:55:23,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:55:23,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:55:23,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:55:23,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:55:23,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:55:23,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:55:23,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:55:23,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:55:23,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:55:23,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:55:23,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:55:23,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:55:23,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:55:23,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:55:23,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:55:23,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:55:23,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:55:23,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:55:23,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:55:23,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:55:23,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:55:23,645 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:55:23,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:55:23,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:55:23,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:55:23,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:55:23,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:55:23,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:55:23,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:55:23,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:55:23,703 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:55:23,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:55:23,705 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:55:23,705 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:55:23,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:55:23,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:55:23,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:55:23,706 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:55:23,706 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:55:23,707 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:55:23,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:55:23,707 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:55:23,707 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:55:23,708 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:55:23,708 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:55:23,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:55:23,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:55:23,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:55:23,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:55:23,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:55:23,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:55:23,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:55:23,710 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:55:23,711 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:55:23,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:55:23,711 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_852b5962-e28b-48af-8370-dd68d6813de1/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_852b5962-e28b-48af-8370-dd68d6813de1/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 -> ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 [2022-11-16 11:55:24,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:55:24,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:55:24,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:55:24,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:55:24,213 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:55:24,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:55:24,295 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/44991908e/a55316cdd736434884883370b6da93c5/FLAG7ab3fb177 [2022-11-16 11:55:24,912 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:55:24,912 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:55:24,925 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/44991908e/a55316cdd736434884883370b6da93c5/FLAG7ab3fb177 [2022-11-16 11:55:25,170 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/data/44991908e/a55316cdd736434884883370b6da93c5 [2022-11-16 11:55:25,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:55:25,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:55:25,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:55:25,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:55:25,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:55:25,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:55:25" (1/1) ... [2022-11-16 11:55:25,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6deeb97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:25, skipping insertion in model container [2022-11-16 11:55:25,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:55:25" (1/1) ... [2022-11-16 11:55:25,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:55:25,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:55:25,541 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_852b5962-e28b-48af-8370-dd68d6813de1/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-16 11:55:25,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:55:25,864 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:55:25,880 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_852b5962-e28b-48af-8370-dd68d6813de1/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-16 11:55:25,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:55:26,008 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:55:26,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26 WrapperNode [2022-11-16 11:55:26,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:55:26,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:55:26,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:55:26,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:55:26,018 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:55:26" (1/1) ... [2022-11-16 11:55:26,048 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:55:26" (1/1) ... [2022-11-16 11:55:26,103 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-11-16 11:55:26,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:55:26,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:55:26,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:55:26,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:55:26,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,160 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:55:26,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:55:26,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:55:26,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:55:26,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (1/1) ... [2022-11-16 11:55:26,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:55:26,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:26,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:55:26,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:55:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:55:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:55:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:55:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:55:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:55:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:55:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:55:26,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:55:26,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:55:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:55:26,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:55:26,289 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:55:26,540 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:55:26,542 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:55:26,930 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:55:27,177 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:55:27,178 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:55:27,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:55:27 BoogieIcfgContainer [2022-11-16 11:55:27,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:55:27,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:55:27,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:55:27,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:55:27,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:55:25" (1/3) ... [2022-11-16 11:55:27,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110aa16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:55:27, skipping insertion in model container [2022-11-16 11:55:27,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:55:26" (2/3) ... [2022-11-16 11:55:27,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110aa16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:55:27, skipping insertion in model container [2022-11-16 11:55:27,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:55:27" (3/3) ... [2022-11-16 11:55:27,192 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:55:27,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:55:27,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 11:55:27,213 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:55:27,296 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:55:27,339 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:55:27,357 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 106 transitions, 222 flow [2022-11-16 11:55:27,362 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 106 transitions, 222 flow [2022-11-16 11:55:27,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 222 flow [2022-11-16 11:55:27,452 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-11-16 11:55:27,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:55:27,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-16 11:55:27,461 INFO L119 LiptonReduction]: Number of co-enabled transitions 1422 [2022-11-16 11:55:35,277 INFO L134 LiptonReduction]: Checked pairs total: 4159 [2022-11-16 11:55:35,277 INFO L136 LiptonReduction]: Total number of compositions: 107 [2022-11-16 11:55:35,285 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 66 flow [2022-11-16 11:55:35,322 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:55:35,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:55:35,353 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;@49c009fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:55:35,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 11:55:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:55:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:55:35,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:35,365 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:55:35,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash 471, now seen corresponding path program 1 times [2022-11-16 11:55:35,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:35,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464060921] [2022-11-16 11:55:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:35,386 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:55:35,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:35,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:35,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:35,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:55:35,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:35,496 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:55:35,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:35,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:35,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464060921] [2022-11-16 11:55:35,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464060921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:35,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:35,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:55:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247738092] [2022-11-16 11:55:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:35,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:55:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:35,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:55:35,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:55:35,531 INFO L87 Difference]: Start difference. First operand has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 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:55:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:35,638 INFO L93 Difference]: Finished difference Result 262 states and 645 transitions. [2022-11-16 11:55:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:55:35,652 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:55:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:35,663 INFO L225 Difference]: With dead ends: 262 [2022-11-16 11:55:35,663 INFO L226 Difference]: Without dead ends: 262 [2022-11-16 11:55:35,664 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:55:35,667 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:35,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-16 11:55:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-16 11:55:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 2.509727626459144) internal successors, (645), 261 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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:55:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 645 transitions. [2022-11-16 11:55:35,777 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 645 transitions. Word has length 1 [2022-11-16 11:55:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:35,778 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 645 transitions. [2022-11-16 11:55:35,778 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:55:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 645 transitions. [2022-11-16 11:55:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:55:35,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:35,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:55:35,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:35,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:35,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:35,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash 447212038, now seen corresponding path program 1 times [2022-11-16 11:55:35,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:35,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030232947] [2022-11-16 11:55:35,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:35,998 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:55:35,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:35,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:36,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:55:36,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:36,172 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:55:36,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:36,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030232947] [2022-11-16 11:55:36,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030232947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:36,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:36,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:55:36,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026167430] [2022-11-16 11:55:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:36,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:55:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:36,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:55:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:55:36,191 INFO L87 Difference]: Start difference. First operand 262 states and 645 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:36,299 INFO L93 Difference]: Finished difference Result 227 states and 552 transitions. [2022-11-16 11:55:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:55:36,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:55:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:36,302 INFO L225 Difference]: With dead ends: 227 [2022-11-16 11:55:36,305 INFO L226 Difference]: Without dead ends: 222 [2022-11-16 11:55:36,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:55:36,307 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:36,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-16 11:55:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-11-16 11:55:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 2.4681818181818183) internal successors, (543), 221 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:55:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 543 transitions. [2022-11-16 11:55:36,336 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 543 transitions. Word has length 5 [2022-11-16 11:55:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:36,337 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 543 transitions. [2022-11-16 11:55:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 543 transitions. [2022-11-16 11:55:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:55:36,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:36,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:36,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -92556783, now seen corresponding path program 1 times [2022-11-16 11:55:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:36,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341921376] [2022-11-16 11:55:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:36,552 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:55:36,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:36,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:36,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:55:36,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:36,684 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:55:36,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:36,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:36,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341921376] [2022-11-16 11:55:36,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341921376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:36,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:36,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:55:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669046690] [2022-11-16 11:55:36,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:36,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:55:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:55:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:55:36,688 INFO L87 Difference]: Start difference. First operand 222 states and 543 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:55:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:36,757 INFO L93 Difference]: Finished difference Result 102 states and 183 transitions. [2022-11-16 11:55:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:55:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 11:55:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:36,759 INFO L225 Difference]: With dead ends: 102 [2022-11-16 11:55:36,759 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:55:36,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:55:36,760 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 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:55:36,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:55:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-16 11:55:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.83) internal successors, (183), 101 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:55:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 183 transitions. [2022-11-16 11:55:36,767 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 183 transitions. Word has length 8 [2022-11-16 11:55:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:36,767 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 183 transitions. [2022-11-16 11:55:36,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:55:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 183 transitions. [2022-11-16 11:55:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:55:36,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:36,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:36,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:36,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash 921124364, now seen corresponding path program 1 times [2022-11-16 11:55:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:36,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284156014] [2022-11-16 11:55:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:36,982 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:55:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:36,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:36,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:37,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:55:37,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:37,125 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:55:37,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:37,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:37,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284156014] [2022-11-16 11:55:37,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284156014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:37,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:37,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:55:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888867083] [2022-11-16 11:55:37,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:37,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:37,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:37,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:37,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:37,129 INFO L87 Difference]: Start difference. First operand 102 states and 183 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:37,230 INFO L93 Difference]: Finished difference Result 52 states and 83 transitions. [2022-11-16 11:55:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:55:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:55:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:37,232 INFO L225 Difference]: With dead ends: 52 [2022-11-16 11:55:37,232 INFO L226 Difference]: Without dead ends: 52 [2022-11-16 11:55:37,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:37,233 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:37,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-16 11:55:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-16 11:55:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:55:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2022-11-16 11:55:37,238 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 12 [2022-11-16 11:55:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:37,238 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2022-11-16 11:55:37,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2022-11-16 11:55:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:37,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:37,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:37,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:37,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:37,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash -59961117, now seen corresponding path program 1 times [2022-11-16 11:55:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:37,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943247700] [2022-11-16 11:55:37,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:37,451 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:55:37,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:37,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:37,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:37,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:55:37,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:37,758 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:55:37,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:37,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:37,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943247700] [2022-11-16 11:55:37,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943247700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:37,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:37,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:55:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657224291] [2022-11-16 11:55:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:37,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:37,762 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:37,878 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2022-11-16 11:55:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:55:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:55:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:37,880 INFO L225 Difference]: With dead ends: 76 [2022-11-16 11:55:37,880 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 11:55:37,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:55:37,881 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:37,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 11:55:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-16 11:55:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 74 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:55:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2022-11-16 11:55:37,886 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 18 [2022-11-16 11:55:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:37,886 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2022-11-16 11:55:37,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-11-16 11:55:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:37,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:37,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:37,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash -59961101, now seen corresponding path program 1 times [2022-11-16 11:55:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:38,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579513158] [2022-11-16 11:55:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:38,090 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:55:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:38,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:38,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:55:38,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:38,458 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:55:38,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:38,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:38,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579513158] [2022-11-16 11:55:38,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579513158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:38,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:38,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:55:38,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11742786] [2022-11-16 11:55:38,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:38,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:38,462 INFO L87 Difference]: Start difference. First operand 75 states and 118 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:38,497 INFO L93 Difference]: Finished difference Result 110 states and 173 transitions. [2022-11-16 11:55:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:55:38,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:55:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:38,498 INFO L225 Difference]: With dead ends: 110 [2022-11-16 11:55:38,499 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 11:55:38,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:38,500 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:38,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-11-16 11:55:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 11:55:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-16 11:55:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 70 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:55:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2022-11-16 11:55:38,504 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 18 [2022-11-16 11:55:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:38,504 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2022-11-16 11:55:38,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2022-11-16 11:55:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:38,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:38,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:38,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 562182759, now seen corresponding path program 2 times [2022-11-16 11:55:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:38,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419854119] [2022-11-16 11:55:38,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:55:38,717 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:55:38,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:38,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:38,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:55:38,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:55:38,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:55:38,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:39,164 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:55:39,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:39,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:39,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419854119] [2022-11-16 11:55:39,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419854119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:39,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:39,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:55:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781649749] [2022-11-16 11:55:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:39,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:55:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:39,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:55:39,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:39,170 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:39,185 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2022-11-16 11:55:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:55:39,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:55:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:39,186 INFO L225 Difference]: With dead ends: 70 [2022-11-16 11:55:39,186 INFO L226 Difference]: Without dead ends: 35 [2022-11-16 11:55:39,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:55:39,187 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:39,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-11-16 11:55:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-16 11:55:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-16 11:55:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:55:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-11-16 11:55:39,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 18 [2022-11-16 11:55:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:39,190 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-11-16 11:55:39,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-11-16 11:55:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:39,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:39,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:39,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:39,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:39,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash 334213733, now seen corresponding path program 2 times [2022-11-16 11:55:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:39,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784456188] [2022-11-16 11:55:39,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:55:39,399 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:55:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:39,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:39,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:39,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:55:39,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:55:39,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:55:39,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:39,820 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:55:39,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:39,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:39,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784456188] [2022-11-16 11:55:39,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784456188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:39,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:39,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:55:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945660443] [2022-11-16 11:55:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:39,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:55:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:39,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:55:39,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:55:39,823 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:39,943 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-11-16 11:55:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:55:39,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:55:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:39,945 INFO L225 Difference]: With dead ends: 50 [2022-11-16 11:55:39,945 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 11:55:39,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:55:39,946 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:39,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 11:55:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-16 11:55:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:55:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-16 11:55:39,948 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2022-11-16 11:55:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:39,949 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-16 11:55:39,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-16 11:55:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:39,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:39,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:39,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:40,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:40,159 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1754618457, now seen corresponding path program 3 times [2022-11-16 11:55:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:40,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367104878] [2022-11-16 11:55:40,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:55:40,161 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:55:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:40,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:40,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:40,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:55:40,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:55:40,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:55:40,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:40,596 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:55:40,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:40,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:40,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367104878] [2022-11-16 11:55:40,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367104878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:40,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:55:40,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:55:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856888744] [2022-11-16 11:55:40,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:40,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:55:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:55:40,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:55:40,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:55:40,599 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:40,752 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-16 11:55:40,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:55:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:55:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:40,753 INFO L225 Difference]: With dead ends: 36 [2022-11-16 11:55:40,753 INFO L226 Difference]: Without dead ends: 23 [2022-11-16 11:55:40,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:55:40,754 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:40,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-16 11:55:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-16 11:55:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:55:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-16 11:55:40,756 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-11-16 11:55:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:40,756 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-16 11:55:40,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:55:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-16 11:55:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:55:40,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:40,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:40,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:40,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:40,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:55:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -224594299, now seen corresponding path program 4 times [2022-11-16 11:55:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729499692] [2022-11-16 11:55:40,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:55:40,972 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:55:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:40,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:40,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:41,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:55:41,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:55:41,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:55:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:55:41,248 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:55:41,249 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:55:41,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 11:55:41,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 11:55:41,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 11:55:41,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 11:55:41,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 11:55:41,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 11:55:41,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 11:55:41,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 11:55:41,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 11:55:41,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 11:55:41,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:41,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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:55:41,456 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-11-16 11:55:41,460 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:55:41,461 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:55:41,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:55:41 BasicIcfg [2022-11-16 11:55:41,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:55:41,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:55:41,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:55:41,511 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:55:41,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:55:27" (3/4) ... [2022-11-16 11:55:41,514 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:55:41,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:55:41,515 INFO L158 Benchmark]: Toolchain (without parser) took 16337.43ms. Allocated memory was 67.1MB in the beginning and 157.3MB in the end (delta: 90.2MB). Free memory was 46.4MB in the beginning and 70.6MB in the end (delta: -24.2MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2022-11-16 11:55:41,515 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:55:41,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 830.16ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 38.2MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:55:41,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.18ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 35.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:55:41,516 INFO L158 Benchmark]: Boogie Preprocessor took 69.45ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 33.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:55:41,517 INFO L158 Benchmark]: RCFGBuilder took 1005.81ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 33.5MB in the beginning and 55.9MB in the end (delta: -22.4MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-11-16 11:55:41,517 INFO L158 Benchmark]: TraceAbstraction took 14325.11ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 55.4MB in the beginning and 70.6MB in the end (delta: -15.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2022-11-16 11:55:41,517 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 157.3MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:55:41,519 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.31ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 830.16ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 38.2MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.18ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 35.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.45ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 33.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1005.81ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 33.5MB in the beginning and 55.9MB in the end (delta: -22.4MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14325.11ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 55.4MB in the beginning and 70.6MB in the end (delta: -15.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 157.3MB. Free memory is still 70.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.9s, 111 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 28 TransitionsAfterwards, 1422 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 4159 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2501, independent: 2345, independent conditional: 0, independent unconditional: 2345, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1110, independent: 1069, independent conditional: 0, independent unconditional: 1069, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1110, independent: 1050, independent conditional: 0, independent unconditional: 1050, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 445, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 393, dependent conditional: 0, dependent unconditional: 393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2501, independent: 1276, independent conditional: 0, independent unconditional: 1276, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1110, unknown conditional: 0, unknown unconditional: 1110] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L717] 0 _Bool x$flush_delayed; [L726] 0 int *x$read_delayed_var; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L718] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd1; [L710] 0 int __unbuffered_p1_EAX = 0; [L721] 0 _Bool x$r_buff0_thd2; [L719] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L714] 0 _Bool main$tmp_guard1; [L730] 0 _Bool x$w_buff1_used; [L713] 0 _Bool main$tmp_guard0; [L712] 0 int __unbuffered_p1_EBX = 0; [L728] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff0; [L729] 0 int x$w_buff1; [L716] 0 int x = 0; [L723] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd0; [L732] 0 int y = 0; [L724] 0 _Bool x$r_buff1_thd2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=-1, t1587={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=0, t1587={3:0}, t1588={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={3:0}, t1588={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 798]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 801]: 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: 803]: 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 5 procedures, 126 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 32 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 42 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 29 QuantifiedInterpolants, 1135 SizeOfPredicates, 12 NumberOfNonLiveVariables, 950 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:55:41,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852b5962-e28b-48af-8370-dd68d6813de1/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