./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 --- 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-4e7fbc6 [2022-11-23 15:55:07,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:55:07,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:55:07,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:55:07,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:55:07,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:55:07,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:55:07,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:55:07,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:55:07,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:55:07,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:55:07,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:55:07,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:55:07,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:55:07,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:55:07,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:55:07,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:55:07,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:55:07,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:55:07,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:55:07,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:55:07,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:55:07,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:55:07,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:55:07,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:55:07,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:55:07,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:55:07,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:55:07,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:55:07,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:55:07,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:55:07,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:55:07,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:55:07,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:55:07,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:55:07,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:55:07,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:55:07,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:55:07,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:55:07,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:55:07,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:55:07,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 15:55:07,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:55:07,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:55:07,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:55:07,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:55:07,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:55:07,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:55:07,664 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:55:07,665 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:55:07,665 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:55:07,665 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:55:07,666 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:55:07,666 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:55:07,667 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:55:07,667 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:55:07,667 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:55:07,667 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:55:07,667 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:55:07,668 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:55:07,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:55:07,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:55:07,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:55:07,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:55:07,669 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:55:07,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:55:07,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:55:07,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:55:07,671 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:55:07,671 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:55:07,671 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:55:07,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:55:07,672 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:55:07,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:55:07,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:55:07,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:55:07,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:55:07,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:55:07,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:55:07,674 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:55:07,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:55:07,674 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:55:07,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:55:07,675 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:55:07,675 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_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/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_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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 -> 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 [2022-11-23 15:55:07,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:55:07,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:55:07,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:55:08,000 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:55:08,012 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:55:08,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i [2022-11-23 15:55:11,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:55:11,298 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:55:11,310 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/sv-benchmarks/c/pthread-wmm/mix015.oepc.i [2022-11-23 15:55:11,328 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data/67328f85e/77e8405935084ea48714302f4ef0ecbb/FLAG2832bbdb2 [2022-11-23 15:55:11,342 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data/67328f85e/77e8405935084ea48714302f4ef0ecbb [2022-11-23 15:55:11,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:55:11,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:55:11,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:55:11,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:55:11,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:55:11,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:11,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41752983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11, skipping insertion in model container [2022-11-23 15:55:11,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:11,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:55:11,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:55:11,589 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/sv-benchmarks/c/pthread-wmm/mix015.oepc.i[945,958] [2022-11-23 15:55:11,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:55:11,848 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:55:11,863 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/sv-benchmarks/c/pthread-wmm/mix015.oepc.i[945,958] [2022-11-23 15:55:11,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:55:11,968 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:55:11,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11 WrapperNode [2022-11-23 15:55:11,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:55:11,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:55:11,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:55:11,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:55:11,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:11,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,017 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-11-23 15:55:12,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:55:12,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:55:12,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:55:12,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:55:12,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,047 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:55:12,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:55:12,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:55:12,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:55:12,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (1/1) ... [2022-11-23 15:55:12,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:55:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:55:12,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:55:12,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:55:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:55:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:55:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:55:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:55:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:55:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:55:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:55:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:55:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:55:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:55:12,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:55:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:55:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:55:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:55:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:55:12,153 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:55:12,338 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:55:12,352 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:55:12,839 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:55:12,975 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:55:12,976 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:55:12,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:12 BoogieIcfgContainer [2022-11-23 15:55:12,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:55:12,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:55:12,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:55:12,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:55:12,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:55:11" (1/3) ... [2022-11-23 15:55:12,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c33f23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:12, skipping insertion in model container [2022-11-23 15:55:12,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:11" (2/3) ... [2022-11-23 15:55:12,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c33f23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:12, skipping insertion in model container [2022-11-23 15:55:12,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:12" (3/3) ... [2022-11-23 15:55:12,988 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2022-11-23 15:55:13,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:55:13,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 15:55:13,017 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:55:13,071 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:55:13,107 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:55:13,122 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 132 transitions, 279 flow [2022-11-23 15:55:13,126 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 132 transitions, 279 flow [2022-11-23 15:55:13,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 279 flow [2022-11-23 15:55:13,181 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-23 15:55:13,181 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:55:13,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-11-23 15:55:13,190 INFO L119 LiptonReduction]: Number of co-enabled transitions 2698 [2022-11-23 15:55:18,845 INFO L134 LiptonReduction]: Checked pairs total: 7668 [2022-11-23 15:55:18,845 INFO L136 LiptonReduction]: Total number of compositions: 132 [2022-11-23 15:55:18,854 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 37 transitions, 89 flow [2022-11-23 15:55:18,961 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:18,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:55:18,988 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;@deba747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:55:18,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 15:55:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:55:19,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:19,001 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:55:19,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 566, now seen corresponding path program 1 times [2022-11-23 15:55:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013181269] [2022-11-23 15:55:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:19,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:19,132 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-23 15:55:19,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:19,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013181269] [2022-11-23 15:55:19,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013181269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:19,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:19,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:55:19,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344913642] [2022-11-23 15:55:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:19,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:55:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:55:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:55:19,170 INFO L87 Difference]: Start difference. First operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 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-23 15:55:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:19,282 INFO L93 Difference]: Finished difference Result 1406 states and 4590 transitions. [2022-11-23 15:55:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:55:19,288 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-23 15:55:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:19,316 INFO L225 Difference]: With dead ends: 1406 [2022-11-23 15:55:19,316 INFO L226 Difference]: Without dead ends: 1406 [2022-11-23 15:55:19,317 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-23 15:55:19,321 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:19,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-11-23 15:55:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2022-11-23 15:55:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1401 states have (on average 3.2762312633832975) internal successors, (4590), 1405 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 4590 transitions. [2022-11-23 15:55:19,442 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 4590 transitions. Word has length 1 [2022-11-23 15:55:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:19,442 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 4590 transitions. [2022-11-23 15:55:19,443 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-23 15:55:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 4590 transitions. [2022-11-23 15:55:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 15:55:19,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:19,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 15:55:19,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:55:19,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash 558792, now seen corresponding path program 1 times [2022-11-23 15:55:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:19,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305338385] [2022-11-23 15:55:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:19,747 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-23 15:55:19,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:19,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305338385] [2022-11-23 15:55:19,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305338385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:19,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:19,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:55:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964878610] [2022-11-23 15:55:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:19,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:55:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:55:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:55:19,752 INFO L87 Difference]: Start difference. First operand 1406 states and 4590 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:19,858 INFO L93 Difference]: Finished difference Result 1184 states and 3825 transitions. [2022-11-23 15:55:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:55:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 15:55:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:19,867 INFO L225 Difference]: With dead ends: 1184 [2022-11-23 15:55:19,867 INFO L226 Difference]: Without dead ends: 1154 [2022-11-23 15:55:19,867 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-23 15:55:19,869 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:19,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:19,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-11-23 15:55:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2022-11-23 15:55:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1152 states have (on average 3.251736111111111) internal successors, (3746), 1153 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 3746 transitions. [2022-11-23 15:55:19,912 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 3746 transitions. Word has length 3 [2022-11-23 15:55:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:19,912 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 3746 transitions. [2022-11-23 15:55:19,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 3746 transitions. [2022-11-23 15:55:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:55:19,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:19,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:19,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:55:19,915 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1172357383, now seen corresponding path program 1 times [2022-11-23 15:55:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:19,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005647605] [2022-11-23 15:55:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:20,347 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-23 15:55:20,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:20,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005647605] [2022-11-23 15:55:20,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005647605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:20,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:20,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:55:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297037691] [2022-11-23 15:55:20,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:20,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:55:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:20,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:55:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:55:20,354 INFO L87 Difference]: Start difference. First operand 1154 states and 3746 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:20,527 INFO L93 Difference]: Finished difference Result 1334 states and 4220 transitions. [2022-11-23 15:55:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:55:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:20,575 INFO L225 Difference]: With dead ends: 1334 [2022-11-23 15:55:20,575 INFO L226 Difference]: Without dead ends: 1334 [2022-11-23 15:55:20,576 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-23 15:55:20,579 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:20,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-11-23 15:55:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1214. [2022-11-23 15:55:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1212 states have (on average 3.245874587458746) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2022-11-23 15:55:20,637 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 10 [2022-11-23 15:55:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:20,638 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2022-11-23 15:55:20,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2022-11-23 15:55:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:55:20,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:20,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:20,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:55:20,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1172357400, now seen corresponding path program 1 times [2022-11-23 15:55:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:20,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426982384] [2022-11-23 15:55:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:21,153 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-23 15:55:21,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:21,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426982384] [2022-11-23 15:55:21,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426982384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:21,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:21,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:55:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886238344] [2022-11-23 15:55:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:21,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:55:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:21,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:55:21,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:55:21,165 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:21,376 INFO L93 Difference]: Finished difference Result 1034 states and 3190 transitions. [2022-11-23 15:55:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:55:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:55:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:21,402 INFO L225 Difference]: With dead ends: 1034 [2022-11-23 15:55:21,402 INFO L226 Difference]: Without dead ends: 854 [2022-11-23 15:55:21,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:55:21,403 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:21,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 21 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:55:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-11-23 15:55:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2022-11-23 15:55:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 3.148886283704572) internal successors, (2686), 853 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2686 transitions. [2022-11-23 15:55:21,433 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 2686 transitions. Word has length 10 [2022-11-23 15:55:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:21,433 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 2686 transitions. [2022-11-23 15:55:21,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 2686 transitions. [2022-11-23 15:55:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:55:21,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:21,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:21,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:55:21,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash -579358168, now seen corresponding path program 1 times [2022-11-23 15:55:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:21,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892599027] [2022-11-23 15:55:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:21,601 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-23 15:55:21,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:21,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892599027] [2022-11-23 15:55:21,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892599027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:21,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:21,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:55:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263036773] [2022-11-23 15:55:21,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:21,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:21,612 INFO L87 Difference]: Start difference. First operand 854 states and 2686 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-23 15:55:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:21,790 INFO L93 Difference]: Finished difference Result 894 states and 2728 transitions. [2022-11-23 15:55:21,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:21,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-23 15:55:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:21,795 INFO L225 Difference]: With dead ends: 894 [2022-11-23 15:55:21,795 INFO L226 Difference]: Without dead ends: 774 [2022-11-23 15:55:21,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-23 15:55:21,796 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:21,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:55:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-23 15:55:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2022-11-23 15:55:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 3.107373868046572) internal successors, (2402), 773 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 2402 transitions. [2022-11-23 15:55:21,823 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 2402 transitions. Word has length 12 [2022-11-23 15:55:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:21,823 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 2402 transitions. [2022-11-23 15:55:21,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-23 15:55:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 2402 transitions. [2022-11-23 15:55:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:55:21,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:21,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:21,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:55:21,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:21,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1838968342, now seen corresponding path program 1 times [2022-11-23 15:55:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:21,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293059063] [2022-11-23 15:55:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:21,982 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-23 15:55:21,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:21,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293059063] [2022-11-23 15:55:21,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293059063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:21,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:21,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:55:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586962462] [2022-11-23 15:55:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:21,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:55:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:55:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:55:21,984 INFO L87 Difference]: Start difference. First operand 774 states and 2402 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-23 15:55:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:22,052 INFO L93 Difference]: Finished difference Result 502 states and 1314 transitions. [2022-11-23 15:55:22,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:55:22,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-23 15:55:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:22,055 INFO L225 Difference]: With dead ends: 502 [2022-11-23 15:55:22,056 INFO L226 Difference]: Without dead ends: 502 [2022-11-23 15:55:22,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:55:22,057 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:22,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-11-23 15:55:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2022-11-23 15:55:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 2.622754491017964) internal successors, (1314), 501 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1314 transitions. [2022-11-23 15:55:22,080 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1314 transitions. Word has length 14 [2022-11-23 15:55:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:22,080 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 1314 transitions. [2022-11-23 15:55:22,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-23 15:55:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1314 transitions. [2022-11-23 15:55:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:55:22,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:22,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:22,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:55:22,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1369132114, now seen corresponding path program 1 times [2022-11-23 15:55:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:22,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124569273] [2022-11-23 15:55:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:55:22,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:22,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124569273] [2022-11-23 15:55:22,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124569273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:22,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:22,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:55:22,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939576227] [2022-11-23 15:55:22,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:22,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:55:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:55:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:55:22,397 INFO L87 Difference]: Start difference. First operand 502 states and 1314 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:22,499 INFO L93 Difference]: Finished difference Result 306 states and 726 transitions. [2022-11-23 15:55:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:55:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 15:55:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:22,501 INFO L225 Difference]: With dead ends: 306 [2022-11-23 15:55:22,501 INFO L226 Difference]: Without dead ends: 306 [2022-11-23 15:55:22,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:55:22,502 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:22,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-23 15:55:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-11-23 15:55:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.380327868852459) internal successors, (726), 305 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 726 transitions. [2022-11-23 15:55:22,516 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 726 transitions. Word has length 17 [2022-11-23 15:55:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:22,516 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 726 transitions. [2022-11-23 15:55:22,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 726 transitions. [2022-11-23 15:55:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 15:55:22,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:22,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:22,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:55:22,520 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:22,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1268483867, now seen corresponding path program 1 times [2022-11-23 15:55:22,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:22,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280418035] [2022-11-23 15:55:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:22,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:22,868 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-23 15:55:22,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:22,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280418035] [2022-11-23 15:55:22,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280418035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:22,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:22,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:55:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160376821] [2022-11-23 15:55:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:22,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:22,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:22,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:22,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:22,870 INFO L87 Difference]: Start difference. First operand 306 states and 726 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:22,994 INFO L93 Difference]: Finished difference Result 258 states and 630 transitions. [2022-11-23 15:55:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:22,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 15:55:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:22,996 INFO L225 Difference]: With dead ends: 258 [2022-11-23 15:55:22,996 INFO L226 Difference]: Without dead ends: 258 [2022-11-23 15:55:22,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:22,997 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:22,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 9 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-23 15:55:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-23 15:55:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.4513618677042803) internal successors, (630), 257 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 630 transitions. [2022-11-23 15:55:23,005 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 630 transitions. Word has length 20 [2022-11-23 15:55:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:23,006 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 630 transitions. [2022-11-23 15:55:23,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 630 transitions. [2022-11-23 15:55:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:55:23,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:23,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:23,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:55:23,008 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1188072280, now seen corresponding path program 1 times [2022-11-23 15:55:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:23,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716433391] [2022-11-23 15:55:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:23,310 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-23 15:55:23,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716433391] [2022-11-23 15:55:23,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716433391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:23,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:23,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:55:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95020812] [2022-11-23 15:55:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:23,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:23,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:23,314 INFO L87 Difference]: Start difference. First operand 258 states and 630 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:23,453 INFO L93 Difference]: Finished difference Result 351 states and 840 transitions. [2022-11-23 15:55:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:55:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:23,454 INFO L225 Difference]: With dead ends: 351 [2022-11-23 15:55:23,455 INFO L226 Difference]: Without dead ends: 198 [2022-11-23 15:55:23,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:55:23,455 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:23,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 11 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-23 15:55:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-23 15:55:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.33502538071066) internal successors, (460), 197 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 460 transitions. [2022-11-23 15:55:23,475 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 460 transitions. Word has length 24 [2022-11-23 15:55:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:23,475 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 460 transitions. [2022-11-23 15:55:23,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 460 transitions. [2022-11-23 15:55:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:55:23,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:23,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:23,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:55:23,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:23,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2003801344, now seen corresponding path program 2 times [2022-11-23 15:55:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:23,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582866549] [2022-11-23 15:55:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:23,709 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-23 15:55:23,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:55:23,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582866549] [2022-11-23 15:55:23,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582866549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:23,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:23,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:55:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898759822] [2022-11-23 15:55:23,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:23,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:23,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:55:23,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:23,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:23,716 INFO L87 Difference]: Start difference. First operand 198 states and 460 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:23,843 INFO L93 Difference]: Finished difference Result 282 states and 643 transitions. [2022-11-23 15:55:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:55:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:23,845 INFO L225 Difference]: With dead ends: 282 [2022-11-23 15:55:23,845 INFO L226 Difference]: Without dead ends: 117 [2022-11-23 15:55:23,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:55:23,846 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:23,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 12 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-23 15:55:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-23 15:55:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.103448275862069) internal successors, (244), 116 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 244 transitions. [2022-11-23 15:55:23,849 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 244 transitions. Word has length 24 [2022-11-23 15:55:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:23,850 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 244 transitions. [2022-11-23 15:55:23,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 244 transitions. [2022-11-23 15:55:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:55:23,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:23,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:23,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 15:55:23,851 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1442239418, now seen corresponding path program 3 times [2022-11-23 15:55:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:55:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108951106] [2022-11-23 15:55:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:55:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:55:23,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:55:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:55:23,972 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:55:23,972 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:55:23,974 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 15:55:23,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 15:55:23,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 15:55:23,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 15:55:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 15:55:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 15:55:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 15:55:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 15:55:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 15:55:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 15:55:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 15:55:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 15:55:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 15:55:23,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:55:23,981 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:23,987 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:55:23,987 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:55:24,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:55:24 BasicIcfg [2022-11-23 15:55:24,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:55:24,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:55:24,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:55:24,098 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:55:24,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:12" (3/4) ... [2022-11-23 15:55:24,101 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:55:24,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:55:24,102 INFO L158 Benchmark]: Toolchain (without parser) took 12755.62ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 108.1MB in the beginning and 52.7MB in the end (delta: 55.4MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2022-11-23 15:55:24,102 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.9MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:55:24,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.49ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 84.7MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 15:55:24,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.26ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 81.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:55:24,103 INFO L158 Benchmark]: Boogie Preprocessor took 33.74ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:55:24,103 INFO L158 Benchmark]: RCFGBuilder took 925.83ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 86.3MB in the end (delta: -6.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 15:55:24,103 INFO L158 Benchmark]: TraceAbstraction took 11116.67ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 85.5MB in the beginning and 53.8MB in the end (delta: 31.7MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2022-11-23 15:55:24,104 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 207.6MB. Free memory was 53.8MB in the beginning and 52.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:55:24,105 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.29ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.9MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.49ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 84.7MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.26ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 81.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.74ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 925.83ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 86.3MB in the end (delta: -6.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11116.67ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 85.5MB in the beginning and 53.8MB in the end (delta: 31.7MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 207.6MB. Free memory was 53.8MB in the beginning and 52.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 140 PlacesBefore, 46 PlacesAfterwards, 132 TransitionsBefore, 37 TransitionsAfterwards, 2698 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 7668 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4023, independent: 3826, independent conditional: 0, independent unconditional: 3826, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1931, independent: 1884, independent conditional: 0, independent unconditional: 1884, 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: 1931, independent: 1863, independent conditional: 0, independent unconditional: 1863, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 297, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4023, independent: 1942, independent conditional: 0, independent unconditional: 1942, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 1931, unknown conditional: 0, unknown unconditional: 1931] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 240, Positive conditional cache size: 0, Positive unconditional cache size: 240, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=-1, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=0, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t387; [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=1, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L809] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 851]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 162 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 773 IncrementalHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 41 mSDtfsCounter, 773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1492occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 120 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 15:55:24,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/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_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 --- 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-4e7fbc6 [2022-11-23 15:55:26,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:55:26,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:55:26,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:55:26,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:55:26,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:55:26,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:55:26,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:55:26,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:55:26,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:55:26,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:55:26,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:55:26,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:55:26,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:55:26,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:55:26,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:55:26,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:55:26,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:55:26,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:55:26,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:55:26,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:55:26,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:55:26,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:55:26,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:55:26,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:55:26,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:55:26,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:55:26,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:55:26,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:55:26,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:55:26,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:55:26,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:55:26,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:55:26,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:55:26,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:55:26,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:55:26,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:55:26,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:55:26,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:55:26,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:55:26,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:55:26,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 15:55:26,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:55:26,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:55:26,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:55:26,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:55:26,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:55:26,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:55:26,803 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:55:26,803 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:55:26,804 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:55:26,804 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:55:26,805 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:55:26,805 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:55:26,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:55:26,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:55:26,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:55:26,807 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:55:26,807 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:55:26,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:55:26,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:55:26,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:55:26,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:55:26,808 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:55:26,809 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:55:26,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:55:26,809 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:55:26,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 15:55:26,810 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 15:55:26,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:55:26,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:55:26,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:55:26,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 15:55:26,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:55:26,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:55:26,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:55:26,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:55:26,812 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 15:55:26,813 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 15:55:26,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:55:26,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 15:55:26,813 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_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/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_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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 -> 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 [2022-11-23 15:55:27,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:55:27,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:55:27,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:55:27,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:55:27,258 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:55:27,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i [2022-11-23 15:55:30,308 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:55:30,622 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:55:30,623 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/sv-benchmarks/c/pthread-wmm/mix015.oepc.i [2022-11-23 15:55:30,637 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data/959656e6d/b93ffcf48b2b4351a4b412b7c11414a8/FLAGb4a5ae8a1 [2022-11-23 15:55:30,656 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/data/959656e6d/b93ffcf48b2b4351a4b412b7c11414a8 [2022-11-23 15:55:30,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:55:30,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:55:30,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:55:30,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:55:30,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:55:30,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:30" (1/1) ... [2022-11-23 15:55:30,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@766c2a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:30, skipping insertion in model container [2022-11-23 15:55:30,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:30" (1/1) ... [2022-11-23 15:55:30,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:55:30,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:55:30,981 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/sv-benchmarks/c/pthread-wmm/mix015.oepc.i[945,958] [2022-11-23 15:55:31,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:55:31,320 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:55:31,360 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/sv-benchmarks/c/pthread-wmm/mix015.oepc.i[945,958] [2022-11-23 15:55:31,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:55:31,510 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:55:31,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31 WrapperNode [2022-11-23 15:55:31,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:55:31,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:55:31,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:55:31,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:55:31,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,598 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-11-23 15:55:31,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:55:31,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:55:31,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:55:31,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:55:31,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,654 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:55:31,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:55:31,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:55:31,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:55:31,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (1/1) ... [2022-11-23 15:55:31,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:55:31,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:55:31,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:55:31,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:55:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:55:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:55:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:55:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:55:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 15:55:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 15:55:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:55:31,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:55:31,760 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:55:31,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:55:31,760 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:55:31,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:55:31,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:55:31,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:55:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:55:31,762 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:55:31,963 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:55:31,980 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:55:32,403 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:55:32,614 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:55:32,614 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:55:32,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:32 BoogieIcfgContainer [2022-11-23 15:55:32,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:55:32,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:55:32,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:55:32,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:55:32,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:55:30" (1/3) ... [2022-11-23 15:55:32,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37aa5155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:32, skipping insertion in model container [2022-11-23 15:55:32,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:31" (2/3) ... [2022-11-23 15:55:32,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37aa5155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:32, skipping insertion in model container [2022-11-23 15:55:32,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:32" (3/3) ... [2022-11-23 15:55:32,626 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2022-11-23 15:55:32,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:55:32,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 15:55:32,646 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:55:32,710 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:55:32,743 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:55:32,758 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 133 transitions, 281 flow [2022-11-23 15:55:32,761 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 133 transitions, 281 flow [2022-11-23 15:55:32,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 133 transitions, 281 flow [2022-11-23 15:55:32,854 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-11-23 15:55:32,855 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:55:32,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-11-23 15:55:32,873 INFO L119 LiptonReduction]: Number of co-enabled transitions 2698 [2022-11-23 15:55:42,289 INFO L134 LiptonReduction]: Checked pairs total: 7672 [2022-11-23 15:55:42,290 INFO L136 LiptonReduction]: Total number of compositions: 131 [2022-11-23 15:55:42,298 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 37 transitions, 89 flow [2022-11-23 15:55:42,421 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:42,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:55:42,446 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;@18bf878b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:55:42,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 15:55:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:55:42,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:42,459 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:55:42,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash 567, now seen corresponding path program 1 times [2022-11-23 15:55:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:42,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58614899] [2022-11-23 15:55:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:42,479 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-23 15:55:42,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:42,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:42,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:42,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 15:55:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:42,615 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-23 15:55:42,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:42,616 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:42,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58614899] [2022-11-23 15:55:42,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58614899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:42,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:42,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:55:42,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698281547] [2022-11-23 15:55:42,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:42,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:55:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:55:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:55:42,659 INFO L87 Difference]: Start difference. First operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 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-23 15:55:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:42,871 INFO L93 Difference]: Finished difference Result 1406 states and 4590 transitions. [2022-11-23 15:55:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:55:42,874 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-23 15:55:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:42,918 INFO L225 Difference]: With dead ends: 1406 [2022-11-23 15:55:42,919 INFO L226 Difference]: Without dead ends: 1406 [2022-11-23 15:55:42,920 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-23 15:55:42,923 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:42,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-11-23 15:55:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2022-11-23 15:55:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1401 states have (on average 3.2762312633832975) internal successors, (4590), 1405 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 4590 transitions. [2022-11-23 15:55:43,204 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 4590 transitions. Word has length 1 [2022-11-23 15:55:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:43,205 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 4590 transitions. [2022-11-23 15:55:43,207 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-23 15:55:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 4590 transitions. [2022-11-23 15:55:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 15:55:43,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:43,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 15:55:43,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:43,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:43,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 558924, now seen corresponding path program 1 times [2022-11-23 15:55:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:43,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336879941] [2022-11-23 15:55:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:43,435 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-23 15:55:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:43,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:43,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:43,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:55:43,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:43,593 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-23 15:55:43,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:43,594 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336879941] [2022-11-23 15:55:43,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336879941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:43,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:55:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698356776] [2022-11-23 15:55:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:43,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:55:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:43,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:55:43,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:55:43,601 INFO L87 Difference]: Start difference. First operand 1406 states and 4590 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:43,735 INFO L93 Difference]: Finished difference Result 1184 states and 3825 transitions. [2022-11-23 15:55:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:55:43,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 15:55:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:43,745 INFO L225 Difference]: With dead ends: 1184 [2022-11-23 15:55:43,745 INFO L226 Difference]: Without dead ends: 1154 [2022-11-23 15:55:43,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:55:43,747 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:43,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-11-23 15:55:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2022-11-23 15:55:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1152 states have (on average 3.251736111111111) internal successors, (3746), 1153 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 3746 transitions. [2022-11-23 15:55:43,795 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 3746 transitions. Word has length 3 [2022-11-23 15:55:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:43,795 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 3746 transitions. [2022-11-23 15:55:43,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 3746 transitions. [2022-11-23 15:55:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:55:43,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:43,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:43,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:44,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:44,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2033850130, now seen corresponding path program 1 times [2022-11-23 15:55:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691131823] [2022-11-23 15:55:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:44,012 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-23 15:55:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:44,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:44,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:44,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:55:44,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:44,191 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-23 15:55:44,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:44,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:44,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691131823] [2022-11-23 15:55:44,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691131823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:44,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:44,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:55:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308322094] [2022-11-23 15:55:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:44,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:55:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:55:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:55:44,196 INFO L87 Difference]: Start difference. First operand 1154 states and 3746 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:44,296 INFO L93 Difference]: Finished difference Result 654 states and 1746 transitions. [2022-11-23 15:55:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:55:44,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:55:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:44,300 INFO L225 Difference]: With dead ends: 654 [2022-11-23 15:55:44,300 INFO L226 Difference]: Without dead ends: 654 [2022-11-23 15:55:44,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-23 15:55:44,304 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:44,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-11-23 15:55:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2022-11-23 15:55:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 652 states have (on average 2.6779141104294477) internal successors, (1746), 653 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1746 transitions. [2022-11-23 15:55:44,331 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1746 transitions. Word has length 10 [2022-11-23 15:55:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:44,331 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 1746 transitions. [2022-11-23 15:55:44,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1746 transitions. [2022-11-23 15:55:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:55:44,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:44,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:44,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 15:55:44,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:44,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:44,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1054662692, now seen corresponding path program 1 times [2022-11-23 15:55:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143253857] [2022-11-23 15:55:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:44,556 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-23 15:55:44,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:44,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:44,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:44,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:55:44,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:44,723 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-23 15:55:44,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:44,723 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:44,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143253857] [2022-11-23 15:55:44,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143253857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:44,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:44,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:55:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742999566] [2022-11-23 15:55:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:44,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:55:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:44,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:55:44,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:55:44,726 INFO L87 Difference]: Start difference. First operand 654 states and 1746 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-23 15:55:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:44,862 INFO L93 Difference]: Finished difference Result 329 states and 771 transitions. [2022-11-23 15:55:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:55:44,863 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-23 15:55:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:44,865 INFO L225 Difference]: With dead ends: 329 [2022-11-23 15:55:44,865 INFO L226 Difference]: Without dead ends: 329 [2022-11-23 15:55:44,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-23 15:55:44,866 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:44,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-23 15:55:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-11-23 15:55:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 327 states have (on average 2.3577981651376145) internal successors, (771), 328 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 771 transitions. [2022-11-23 15:55:44,883 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 771 transitions. Word has length 14 [2022-11-23 15:55:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:44,884 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 771 transitions. [2022-11-23 15:55:44,884 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-23 15:55:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 771 transitions. [2022-11-23 15:55:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:55:44,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:44,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:44,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,103 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1487158981, now seen corresponding path program 1 times [2022-11-23 15:55:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:45,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726077576] [2022-11-23 15:55:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:45,104 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-23 15:55:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:45,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:45,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 15:55:45,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:45,307 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-23 15:55:45,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:45,308 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:45,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726077576] [2022-11-23 15:55:45,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726077576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:45,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:45,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:55:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103334094] [2022-11-23 15:55:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:45,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:45,311 INFO L87 Difference]: Start difference. First operand 329 states and 771 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:45,508 INFO L93 Difference]: Finished difference Result 259 states and 631 transitions. [2022-11-23 15:55:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:45,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 15:55:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:45,510 INFO L225 Difference]: With dead ends: 259 [2022-11-23 15:55:45,510 INFO L226 Difference]: Without dead ends: 259 [2022-11-23 15:55:45,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:45,511 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:45,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 36 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:55:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-23 15:55:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-11-23 15:55:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 257 states have (on average 2.455252918287938) internal successors, (631), 258 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 631 transitions. [2022-11-23 15:55:45,519 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 631 transitions. Word has length 19 [2022-11-23 15:55:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:45,520 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 631 transitions. [2022-11-23 15:55:45,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 631 transitions. [2022-11-23 15:55:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:55:45,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:45,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:45,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1522156748, now seen corresponding path program 1 times [2022-11-23 15:55:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:45,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406419741] [2022-11-23 15:55:45,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:45,737 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-23 15:55:45,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:45,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:45,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 15:55:45,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:46,416 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-23 15:55:46,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:46,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:46,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406419741] [2022-11-23 15:55:46,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406419741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:46,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:46,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:55:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256691233] [2022-11-23 15:55:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:46,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:46,418 INFO L87 Difference]: Start difference. First operand 259 states and 631 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:46,661 INFO L93 Difference]: Finished difference Result 258 states and 630 transitions. [2022-11-23 15:55:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:55:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:46,663 INFO L225 Difference]: With dead ends: 258 [2022-11-23 15:55:46,663 INFO L226 Difference]: Without dead ends: 258 [2022-11-23 15:55:46,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:46,664 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:46,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:55:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-23 15:55:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-23 15:55:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.4513618677042803) internal successors, (630), 257 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 630 transitions. [2022-11-23 15:55:46,673 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 630 transitions. Word has length 24 [2022-11-23 15:55:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:46,673 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 630 transitions. [2022-11-23 15:55:46,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 630 transitions. [2022-11-23 15:55:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:55:46,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:46,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:46,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:46,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:46,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1522156719, now seen corresponding path program 1 times [2022-11-23 15:55:46,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:46,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108150856] [2022-11-23 15:55:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:55:46,893 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-23 15:55:46,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:46,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:46,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:55:47,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:55:47,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:55:47,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:47,189 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:47,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108150856] [2022-11-23 15:55:47,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108150856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:47,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:47,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:55:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554345861] [2022-11-23 15:55:47,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:47,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:47,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:47,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:47,191 INFO L87 Difference]: Start difference. First operand 258 states and 630 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:47,381 INFO L93 Difference]: Finished difference Result 351 states and 840 transitions. [2022-11-23 15:55:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:47,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:55:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:47,383 INFO L225 Difference]: With dead ends: 351 [2022-11-23 15:55:47,383 INFO L226 Difference]: Without dead ends: 198 [2022-11-23 15:55:47,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:55:47,384 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:47,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 20 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:55:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-23 15:55:47,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-23 15:55:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.33502538071066) internal successors, (460), 197 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 460 transitions. [2022-11-23 15:55:47,397 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 460 transitions. Word has length 24 [2022-11-23 15:55:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:47,397 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 460 transitions. [2022-11-23 15:55:47,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 460 transitions. [2022-11-23 15:55:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:55:47,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:47,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:47,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:47,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:47,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash -170923283, now seen corresponding path program 2 times [2022-11-23 15:55:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:47,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499627618] [2022-11-23 15:55:47,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:55:47,612 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-23 15:55:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:47,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:47,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:47,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 15:55:47,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:55:47,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:55:47,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:55:47,809 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-23 15:55:47,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:55:47,810 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:55:47,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499627618] [2022-11-23 15:55:47,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499627618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:55:47,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:55:47,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:55:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285832057] [2022-11-23 15:55:47,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:55:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:55:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:55:47,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:55:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:55:47,812 INFO L87 Difference]: Start difference. First operand 198 states and 460 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:55:47,984 INFO L93 Difference]: Finished difference Result 282 states and 643 transitions. [2022-11-23 15:55:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:55:47,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:55:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:55:47,986 INFO L225 Difference]: With dead ends: 282 [2022-11-23 15:55:47,986 INFO L226 Difference]: Without dead ends: 117 [2022-11-23 15:55:47,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:55:47,987 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:55:47,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:55:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-23 15:55:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-23 15:55:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.103448275862069) internal successors, (244), 116 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 244 transitions. [2022-11-23 15:55:47,991 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 244 transitions. Word has length 24 [2022-11-23 15:55:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:55:47,991 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 244 transitions. [2022-11-23 15:55:47,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:55:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 244 transitions. [2022-11-23 15:55:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:55:47,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:55:47,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:48,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:48,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:48,202 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:55:48,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:55:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -876021861, now seen corresponding path program 3 times [2022-11-23 15:55:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:55:48,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238537117] [2022-11-23 15:55:48,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:55:48,203 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-23 15:55:48,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:55:48,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:48,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:48,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:55:48,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 15:55:48,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:55:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:55:48,532 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 15:55:48,533 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:55:48,534 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 15:55:48,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 15:55:48,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 15:55:48,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 15:55:48,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 15:55:48,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 15:55:48,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 15:55:48,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 15:55:48,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 15:55:48,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 15:55:48,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 15:55:48,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 15:55:48,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 15:55:48,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:48,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:55:48,753 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-11-23 15:55:48,756 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:55:48,757 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:55:48,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:55:48 BasicIcfg [2022-11-23 15:55:48,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:55:48,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:55:48,826 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:55:48,827 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:55:48,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:32" (3/4) ... [2022-11-23 15:55:48,830 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:55:48,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:55:48,831 INFO L158 Benchmark]: Toolchain (without parser) took 18166.34ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 41.0MB in the beginning and 31.1MB in the end (delta: 9.9MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2022-11-23 15:55:48,831 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 65.0MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:55:48,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 844.86ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 40.9MB in the beginning and 48.6MB in the end (delta: -7.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 15:55:48,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.27ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 45.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:55:48,832 INFO L158 Benchmark]: Boogie Preprocessor took 69.05ms. Allocated memory is still 79.7MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:55:48,832 INFO L158 Benchmark]: RCFGBuilder took 948.06ms. Allocated memory is still 79.7MB. Free memory was 43.8MB in the beginning and 51.0MB in the end (delta: -7.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-11-23 15:55:48,833 INFO L158 Benchmark]: TraceAbstraction took 16206.63ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 50.5MB in the beginning and 31.1MB in the end (delta: 19.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2022-11-23 15:55:48,833 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 117.4MB. Free memory is still 31.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:55:48,835 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.27ms. Allocated memory is still 65.0MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 844.86ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 40.9MB in the beginning and 48.6MB in the end (delta: -7.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.27ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 45.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.05ms. Allocated memory is still 79.7MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 948.06ms. Allocated memory is still 79.7MB. Free memory was 43.8MB in the beginning and 51.0MB in the end (delta: -7.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16206.63ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 50.5MB in the beginning and 31.1MB in the end (delta: 19.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 117.4MB. Free memory is still 31.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 141 PlacesBefore, 46 PlacesAfterwards, 133 TransitionsBefore, 37 TransitionsAfterwards, 2698 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 7672 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3807, independent: 3612, independent conditional: 0, independent unconditional: 3612, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1889, independent: 1841, independent conditional: 0, independent unconditional: 1841, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1889, independent: 1822, independent conditional: 0, independent unconditional: 1822, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 353, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 315, dependent conditional: 0, dependent unconditional: 315, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3807, independent: 1771, independent conditional: 0, independent unconditional: 1771, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1889, unknown conditional: 0, unknown unconditional: 1889] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 224, Positive conditional cache size: 0, Positive unconditional cache size: 224, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=0, t385={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=1, t385={-6:0}, t386={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=2, t385={-6:0}, t386={-10:0}, t387={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 [L763] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L809] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={-6:0}, t386={-10:0}, t387={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 851]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 163 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 633 IncrementalHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 55 mSDtfsCounter, 633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1492occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 111 ConstructedInterpolants, 19 QuantifiedInterpolants, 1014 SizeOfPredicates, 16 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-23 15:55:48,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45317d28-cfc3-46ee-a0d3-452739658c74/bin/utaipan-Q6hlc19bkW/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