./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9 --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 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:20:37,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:20:37,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:20:38,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:20:38,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:20:38,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:20:38,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:20:38,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:20:38,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:20:38,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:20:38,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:20:38,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:20:38,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:20:38,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:20:38,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:20:38,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:20:38,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:20:38,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:20:38,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:20:38,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:20:38,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:20:38,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:20:38,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:20:38,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:20:38,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:20:38,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:20:38,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:20:38,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:20:38,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:20:38,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:20:38,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:20:38,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:20:38,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:20:38,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:20:38,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:20:38,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:20:38,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:20:38,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:20:38,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:20:38,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:20:38,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:20:38,089 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-20 20:20:38,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:20:38,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:20:38,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:20:38,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:20:38,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:20:38,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:20:38,129 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:20:38,129 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:20:38,130 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:20:38,130 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:20:38,131 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:20:38,131 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:20:38,131 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:20:38,131 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:20:38,131 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:20:38,132 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:20:38,132 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:20:38,132 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:20:38,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:20:38,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:20:38,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:20:38,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:20:38,133 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:20:38,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:20:38,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:20:38,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:20:38,135 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:20:38,135 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:20:38,135 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:20:38,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:20:38,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:20:38,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:20:38,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:20:38,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:20:38,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:20:38,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:20:38,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:20:38,137 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:20:38,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:20:38,137 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:20:38,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:20:38,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:20:38,137 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_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/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_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9 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 -> 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 [2022-11-20 20:20:38,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:20:38,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:20:38,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:20:38,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:20:38,471 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:20:38,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2022-11-20 20:20:41,349 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:20:41,664 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:20:41,664 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2022-11-20 20:20:41,679 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data/3c9178f15/54484947e90a4562b26200ba1de1cf5e/FLAG3dc247e3f [2022-11-20 20:20:41,694 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data/3c9178f15/54484947e90a4562b26200ba1de1cf5e [2022-11-20 20:20:41,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:20:41,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:20:41,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:20:41,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:20:41,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:20:41,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:20:41" (1/1) ... [2022-11-20 20:20:41,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e934296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:41, skipping insertion in model container [2022-11-20 20:20:41,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:20:41" (1/1) ... [2022-11-20 20:20:41,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:20:41,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:20:41,937 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_265cb97f-0765-411a-a8fd-6d608f5cffb4/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2022-11-20 20:20:42,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:20:42,263 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:20:42,276 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_265cb97f-0765-411a-a8fd-6d608f5cffb4/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2022-11-20 20:20:42,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:20:42,418 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:20:42,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42 WrapperNode [2022-11-20 20:20:42,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:20:42,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:20:42,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:20:42,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:20:42,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,508 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-11-20 20:20:42,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:20:42,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:20:42,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:20:42,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:20:42,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:20:42,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:20:42,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:20:42,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:20:42,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (1/1) ... [2022-11-20 20:20:42,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:20:42,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:20:42,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:20:42,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:20:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:20:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 20:20:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:20:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:20:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:20:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 20:20:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 20:20:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 20:20:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 20:20:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 20:20:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 20:20:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 20:20:42,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 20:20:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:20:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 20:20:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:20:42,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:20:42,682 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:20:42,876 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:20:42,878 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:20:43,323 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:20:43,434 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:20:43,434 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 20:20:43,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:20:43 BoogieIcfgContainer [2022-11-20 20:20:43,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:20:43,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:20:43,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:20:43,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:20:43,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:20:41" (1/3) ... [2022-11-20 20:20:43,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300d3dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:20:43, skipping insertion in model container [2022-11-20 20:20:43,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:42" (2/3) ... [2022-11-20 20:20:43,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300d3dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:20:43, skipping insertion in model container [2022-11-20 20:20:43,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:20:43" (3/3) ... [2022-11-20 20:20:43,447 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2022-11-20 20:20:43,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:20:43,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-20 20:20:43,467 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:20:43,526 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 20:20:43,560 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:20:43,575 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 314 flow [2022-11-20 20:20:43,578 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 314 flow [2022-11-20 20:20:43,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2022-11-20 20:20:43,643 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2022-11-20 20:20:43,646 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 20:20:43,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-20 20:20:43,659 INFO L119 LiptonReduction]: Number of co-enabled transitions 3626 [2022-11-20 20:20:50,229 INFO L134 LiptonReduction]: Checked pairs total: 10419 [2022-11-20 20:20:50,229 INFO L136 LiptonReduction]: Total number of compositions: 138 [2022-11-20 20:20:50,240 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-20 20:20:50,638 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5494 states, 5477 states have (on average 4.097316048931897) internal successors, (22441), 5493 states have internal predecessors, (22441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:50,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:20:50,666 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;@52b6268a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:20:50,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-20 20:20:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 5494 states, 5477 states have (on average 4.097316048931897) internal successors, (22441), 5493 states have internal predecessors, (22441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 20:20:50,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:50,693 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 20:20:50,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:50,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2022-11-20 20:20:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:50,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639762481] [2022-11-20 20:20:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:50,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:50,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639762481] [2022-11-20 20:20:50,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639762481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:50,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:50,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 20:20:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530668313] [2022-11-20 20:20:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:50,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 20:20:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:50,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 20:20:50,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:20:50,873 INFO L87 Difference]: Start difference. First operand has 5494 states, 5477 states have (on average 4.097316048931897) internal successors, (22441), 5493 states have internal predecessors, (22441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:51,080 INFO L93 Difference]: Finished difference Result 5122 states and 20483 transitions. [2022-11-20 20:20:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 20:20:51,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 20:20:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:51,145 INFO L225 Difference]: With dead ends: 5122 [2022-11-20 20:20:51,145 INFO L226 Difference]: Without dead ends: 5122 [2022-11-20 20:20:51,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:20:51,149 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:51,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:20:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2022-11-20 20:20:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 5122. [2022-11-20 20:20:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5122 states, 5117 states have (on average 4.002931405120187) internal successors, (20483), 5121 states have internal predecessors, (20483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 20483 transitions. [2022-11-20 20:20:51,585 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 20483 transitions. Word has length 1 [2022-11-20 20:20:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:51,586 INFO L495 AbstractCegarLoop]: Abstraction has 5122 states and 20483 transitions. [2022-11-20 20:20:51,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 20483 transitions. [2022-11-20 20:20:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:20:51,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:51,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:20:51,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:20:51,588 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash 584536903, now seen corresponding path program 1 times [2022-11-20 20:20:51,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:51,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561517555] [2022-11-20 20:20:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:51,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:51,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561517555] [2022-11-20 20:20:51,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561517555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:51,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:51,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:20:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121151889] [2022-11-20 20:20:51,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:51,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:20:51,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:20:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:20:51,948 INFO L87 Difference]: Start difference. First operand 5122 states and 20483 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:52,111 INFO L93 Difference]: Finished difference Result 4187 states and 16550 transitions. [2022-11-20 20:20:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:20:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 20:20:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:52,146 INFO L225 Difference]: With dead ends: 4187 [2022-11-20 20:20:52,146 INFO L226 Difference]: Without dead ends: 4062 [2022-11-20 20:20:52,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:20:52,149 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:52,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 8 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:20:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-11-20 20:20:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-11-20 20:20:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4060 states have (on average 3.9716748768472905) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-11-20 20:20:52,478 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 5 [2022-11-20 20:20:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:52,479 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-11-20 20:20:52,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-11-20 20:20:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:20:52,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:52,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:20:52,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:20:52,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 272657463, now seen corresponding path program 1 times [2022-11-20 20:20:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:52,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517763460] [2022-11-20 20:20:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:52,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:53,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517763460] [2022-11-20 20:20:53,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517763460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:53,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:53,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:20:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372764703] [2022-11-20 20:20:53,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:53,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:20:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:53,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:20:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:20:53,484 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 20:20:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:53,749 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions. [2022-11-20 20:20:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:20:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 20:20:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:53,776 INFO L225 Difference]: With dead ends: 3437 [2022-11-20 20:20:53,776 INFO L226 Difference]: Without dead ends: 3437 [2022-11-20 20:20:53,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:20:53,778 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:53,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 40 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:20:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2022-11-20 20:20:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2022-11-20 20:20:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 3436 states have (on average 3.928987194412107) internal successors, (13500), 3436 states have internal predecessors, (13500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 13500 transitions. [2022-11-20 20:20:53,952 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 13500 transitions. Word has length 12 [2022-11-20 20:20:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:53,953 INFO L495 AbstractCegarLoop]: Abstraction has 3437 states and 13500 transitions. [2022-11-20 20:20:53,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 20:20:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 13500 transitions. [2022-11-20 20:20:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:20:53,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:53,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:20:53,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:20:53,956 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:53,957 INFO L85 PathProgramCache]: Analyzing trace with hash 272657408, now seen corresponding path program 1 times [2022-11-20 20:20:53,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:53,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705493897] [2022-11-20 20:20:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:54,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:54,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705493897] [2022-11-20 20:20:54,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705493897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:54,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:54,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:20:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344829720] [2022-11-20 20:20:54,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:54,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:20:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:20:54,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:20:54,960 INFO L87 Difference]: Start difference. First operand 3437 states and 13500 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-20 20:20:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:55,452 INFO L93 Difference]: Finished difference Result 4787 states and 18403 transitions. [2022-11-20 20:20:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:20:55,452 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-20 20:20:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:55,495 INFO L225 Difference]: With dead ends: 4787 [2022-11-20 20:20:55,495 INFO L226 Difference]: Without dead ends: 4037 [2022-11-20 20:20:55,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:20:55,499 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 60 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:55,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 19 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:20:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2022-11-20 20:20:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 3517. [2022-11-20 20:20:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3516 states have (on average 3.8939135381114904) internal successors, (13691), 3516 states have internal predecessors, (13691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 13691 transitions. [2022-11-20 20:20:55,697 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 13691 transitions. Word has length 12 [2022-11-20 20:20:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:55,699 INFO L495 AbstractCegarLoop]: Abstraction has 3517 states and 13691 transitions. [2022-11-20 20:20:55,699 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-20 20:20:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 13691 transitions. [2022-11-20 20:20:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:20:55,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:55,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:20:55,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:20:55,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2082102259, now seen corresponding path program 1 times [2022-11-20 20:20:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:55,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588514588] [2022-11-20 20:20:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:56,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:56,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588514588] [2022-11-20 20:20:56,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588514588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:56,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:56,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:20:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390905536] [2022-11-20 20:20:56,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:56,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:20:56,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:56,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:20:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:20:56,446 INFO L87 Difference]: Start difference. First operand 3517 states and 13691 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:56,788 INFO L93 Difference]: Finished difference Result 4699 states and 17833 transitions. [2022-11-20 20:20:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:20:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 20:20:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:56,810 INFO L225 Difference]: With dead ends: 4699 [2022-11-20 20:20:56,810 INFO L226 Difference]: Without dead ends: 3905 [2022-11-20 20:20:56,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:20:56,811 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:56,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 33 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:20:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-11-20 20:20:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3809. [2022-11-20 20:20:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3808 states have (on average 3.8374474789915967) internal successors, (14613), 3808 states have internal predecessors, (14613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 14613 transitions. [2022-11-20 20:20:56,943 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 14613 transitions. Word has length 13 [2022-11-20 20:20:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:56,943 INFO L495 AbstractCegarLoop]: Abstraction has 3809 states and 14613 transitions. [2022-11-20 20:20:56,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 14613 transitions. [2022-11-20 20:20:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:20:56,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:56,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:20:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:20:56,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -49817550, now seen corresponding path program 1 times [2022-11-20 20:20:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:56,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375366380] [2022-11-20 20:20:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:57,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:57,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375366380] [2022-11-20 20:20:57,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375366380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:57,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:57,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:20:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021600815] [2022-11-20 20:20:57,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:57,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:20:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:57,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:20:57,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:20:57,229 INFO L87 Difference]: Start difference. First operand 3809 states and 14613 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:57,399 INFO L93 Difference]: Finished difference Result 4103 states and 15432 transitions. [2022-11-20 20:20:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:20:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 20:20:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:57,419 INFO L225 Difference]: With dead ends: 4103 [2022-11-20 20:20:57,420 INFO L226 Difference]: Without dead ends: 3753 [2022-11-20 20:20:57,420 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-20 20:20:57,423 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:57,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 18 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:20:57,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2022-11-20 20:20:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3753. [2022-11-20 20:20:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3752 states have (on average 3.829690831556503) internal successors, (14369), 3752 states have internal predecessors, (14369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 14369 transitions. [2022-11-20 20:20:57,544 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 14369 transitions. Word has length 15 [2022-11-20 20:20:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:57,545 INFO L495 AbstractCegarLoop]: Abstraction has 3753 states and 14369 transitions. [2022-11-20 20:20:57,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 14369 transitions. [2022-11-20 20:20:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 20:20:57,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:57,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:20:57,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:20:57,551 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:57,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1628893452, now seen corresponding path program 1 times [2022-11-20 20:20:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:57,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357407876] [2022-11-20 20:20:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:57,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:57,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357407876] [2022-11-20 20:20:57,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357407876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:57,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:57,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:20:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125626403] [2022-11-20 20:20:57,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:57,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:20:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:20:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:20:57,793 INFO L87 Difference]: Start difference. First operand 3753 states and 14369 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:57,884 INFO L93 Difference]: Finished difference Result 2816 states and 9709 transitions. [2022-11-20 20:20:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:20:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 20:20:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:57,897 INFO L225 Difference]: With dead ends: 2816 [2022-11-20 20:20:57,897 INFO L226 Difference]: Without dead ends: 2816 [2022-11-20 20:20:57,898 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-20 20:20:57,899 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:57,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:20:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2022-11-20 20:20:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2816. [2022-11-20 20:20:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2815 states have (on average 3.4490230905861456) internal successors, (9709), 2815 states have internal predecessors, (9709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 9709 transitions. [2022-11-20 20:20:58,063 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 9709 transitions. Word has length 16 [2022-11-20 20:20:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:58,063 INFO L495 AbstractCegarLoop]: Abstraction has 2816 states and 9709 transitions. [2022-11-20 20:20:58,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 9709 transitions. [2022-11-20 20:20:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:20:58,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:58,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:20:58,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:20:58,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -606574568, now seen corresponding path program 1 times [2022-11-20 20:20:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459324601] [2022-11-20 20:20:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:58,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459324601] [2022-11-20 20:20:58,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459324601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:58,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:58,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:20:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005763842] [2022-11-20 20:20:58,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:58,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:20:58,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:58,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:20:58,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:20:58,360 INFO L87 Difference]: Start difference. First operand 2816 states and 9709 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-20 20:20:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:58,477 INFO L93 Difference]: Finished difference Result 1690 states and 5239 transitions. [2022-11-20 20:20:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:20:58,478 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-20 20:20:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:58,485 INFO L225 Difference]: With dead ends: 1690 [2022-11-20 20:20:58,486 INFO L226 Difference]: Without dead ends: 1690 [2022-11-20 20:20:58,486 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-20 20:20:58,488 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:58,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 12 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:20:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-11-20 20:20:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1526. [2022-11-20 20:20:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 3.064262295081967) internal successors, (4673), 1525 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 4673 transitions. [2022-11-20 20:20:58,542 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 4673 transitions. Word has length 17 [2022-11-20 20:20:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:58,543 INFO L495 AbstractCegarLoop]: Abstraction has 1526 states and 4673 transitions. [2022-11-20 20:20:58,543 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-20 20:20:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 4673 transitions. [2022-11-20 20:20:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:20:58,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:58,550 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-20 20:20:58,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:20:58,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1272566442, now seen corresponding path program 1 times [2022-11-20 20:20:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:58,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210164066] [2022-11-20 20:20:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:59,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:59,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210164066] [2022-11-20 20:20:59,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210164066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:59,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:59,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:20:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294372391] [2022-11-20 20:20:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:59,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:20:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:20:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:20:59,066 INFO L87 Difference]: Start difference. First operand 1526 states and 4673 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:59,356 INFO L93 Difference]: Finished difference Result 2244 states and 6662 transitions. [2022-11-20 20:20:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:20:59,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 20:20:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:59,364 INFO L225 Difference]: With dead ends: 2244 [2022-11-20 20:20:59,364 INFO L226 Difference]: Without dead ends: 1562 [2022-11-20 20:20:59,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:20:59,365 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:59,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 19 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:20:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-11-20 20:20:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1495. [2022-11-20 20:20:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1494 states have (on average 2.9839357429718874) internal successors, (4458), 1494 states have internal predecessors, (4458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 4458 transitions. [2022-11-20 20:20:59,412 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 4458 transitions. Word has length 20 [2022-11-20 20:20:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:59,412 INFO L495 AbstractCegarLoop]: Abstraction has 1495 states and 4458 transitions. [2022-11-20 20:20:59,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 4458 transitions. [2022-11-20 20:20:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:20:59,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:59,416 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-20 20:20:59,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:20:59,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2130789677, now seen corresponding path program 1 times [2022-11-20 20:20:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:59,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414577213] [2022-11-20 20:20:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:20:59,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414577213] [2022-11-20 20:20:59,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414577213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:20:59,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:20:59,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:20:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127740091] [2022-11-20 20:20:59,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:20:59,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:20:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:20:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:20:59,664 INFO L87 Difference]: Start difference. First operand 1495 states and 4458 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-20 20:20:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:59,796 INFO L93 Difference]: Finished difference Result 1109 states and 3326 transitions. [2022-11-20 20:20:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:20:59,797 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-20 20:20:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:59,801 INFO L225 Difference]: With dead ends: 1109 [2022-11-20 20:20:59,801 INFO L226 Difference]: Without dead ends: 1109 [2022-11-20 20:20:59,801 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-20 20:20:59,802 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:59,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 16 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:20:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-20 20:20:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1021. [2022-11-20 20:20:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.0098039215686274) internal successors, (3070), 1020 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:20:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 3070 transitions. [2022-11-20 20:20:59,828 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 3070 transitions. Word has length 20 [2022-11-20 20:20:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:59,828 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 3070 transitions. [2022-11-20 20:20:59,828 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-20 20:20:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 3070 transitions. [2022-11-20 20:20:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:20:59,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:59,832 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-20 20:20:59,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:20:59,832 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:20:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash 723564664, now seen corresponding path program 1 times [2022-11-20 20:20:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:59,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331656259] [2022-11-20 20:20:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:00,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:00,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331656259] [2022-11-20 20:21:00,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331656259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:00,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:00,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:21:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463593336] [2022-11-20 20:21:00,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:00,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:21:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:00,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:21:00,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:21:00,285 INFO L87 Difference]: Start difference. First operand 1021 states and 3070 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:00,721 INFO L93 Difference]: Finished difference Result 1456 states and 4284 transitions. [2022-11-20 20:21:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:21:00,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 20:21:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:00,725 INFO L225 Difference]: With dead ends: 1456 [2022-11-20 20:21:00,725 INFO L226 Difference]: Without dead ends: 1055 [2022-11-20 20:21:00,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:21:00,726 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:00,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 33 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-11-20 20:21:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 981. [2022-11-20 20:21:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 2.8938775510204082) internal successors, (2836), 980 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2836 transitions. [2022-11-20 20:21:00,750 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2836 transitions. Word has length 24 [2022-11-20 20:21:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:00,750 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 2836 transitions. [2022-11-20 20:21:00,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2836 transitions. [2022-11-20 20:21:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:21:00,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:00,753 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-20 20:21:00,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 20:21:00,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:00,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1213704977, now seen corresponding path program 1 times [2022-11-20 20:21:00,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:00,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896491992] [2022-11-20 20:21:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:00,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:01,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:01,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896491992] [2022-11-20 20:21:01,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896491992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:01,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:01,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:21:01,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529082273] [2022-11-20 20:21:01,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:01,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:21:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:01,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:21:01,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:21:01,033 INFO L87 Difference]: Start difference. First operand 981 states and 2836 transitions. Second operand has 6 states, 6 states have (on average 4.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-20 20:21:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:01,170 INFO L93 Difference]: Finished difference Result 917 states and 2712 transitions. [2022-11-20 20:21:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:21:01,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.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-20 20:21:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:01,172 INFO L225 Difference]: With dead ends: 917 [2022-11-20 20:21:01,172 INFO L226 Difference]: Without dead ends: 349 [2022-11-20 20:21:01,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:21:01,173 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 113 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:01,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 14 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:21:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-20 20:21:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 333. [2022-11-20 20:21:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.7349397590361444) internal successors, (908), 332 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 908 transitions. [2022-11-20 20:21:01,181 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 908 transitions. Word has length 24 [2022-11-20 20:21:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:01,181 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 908 transitions. [2022-11-20 20:21:01,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.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-20 20:21:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 908 transitions. [2022-11-20 20:21:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 20:21:01,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:01,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:01,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 20:21:01,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -78135948, now seen corresponding path program 1 times [2022-11-20 20:21:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:01,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970032138] [2022-11-20 20:21:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:03,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:03,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970032138] [2022-11-20 20:21:03,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970032138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:03,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:03,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 20:21:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633056882] [2022-11-20 20:21:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:03,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:21:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:03,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:21:03,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:21:03,068 INFO L87 Difference]: Start difference. First operand 333 states and 908 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:03,625 INFO L93 Difference]: Finished difference Result 414 states and 1116 transitions. [2022-11-20 20:21:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:21:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-20 20:21:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:03,627 INFO L225 Difference]: With dead ends: 414 [2022-11-20 20:21:03,627 INFO L226 Difference]: Without dead ends: 265 [2022-11-20 20:21:03,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:21:03,627 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 126 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:03,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 31 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-20 20:21:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 257. [2022-11-20 20:21:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 2.671875) internal successors, (684), 256 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 684 transitions. [2022-11-20 20:21:03,635 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 684 transitions. Word has length 28 [2022-11-20 20:21:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:03,635 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 684 transitions. [2022-11-20 20:21:03,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 684 transitions. [2022-11-20 20:21:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 20:21:03,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:03,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:03,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 20:21:03,639 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:03,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1872395276, now seen corresponding path program 2 times [2022-11-20 20:21:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:03,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561360502] [2022-11-20 20:21:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:21:03,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:21:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:21:03,870 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 20:21:03,871 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:21:03,872 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-20 20:21:03,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-20 20:21:03,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-20 20:21:03,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-20 20:21:03,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-20 20:21:03,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-20 20:21:03,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-20 20:21:03,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-20 20:21:03,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-20 20:21:03,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-20 20:21:03,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-20 20:21:03,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-20 20:21:03,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-20 20:21:03,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-20 20:21:03,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-20 20:21:03,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-20 20:21:03,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 20:21:03,882 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:03,888 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 20:21:03,888 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:21:03,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:21:03 BasicIcfg [2022-11-20 20:21:03,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:21:03,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:21:03,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:21:03,999 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:21:03,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:20:43" (3/4) ... [2022-11-20 20:21:04,002 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 20:21:04,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:21:04,003 INFO L158 Benchmark]: Toolchain (without parser) took 22304.84ms. Allocated memory was 201.3MB in the beginning and 740.3MB in the end (delta: 539.0MB). Free memory was 171.8MB in the beginning and 180.7MB in the end (delta: -8.9MB). Peak memory consumption was 533.1MB. Max. memory is 16.1GB. [2022-11-20 20:21:04,003 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:21:04,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.28ms. Allocated memory is still 201.3MB. Free memory was 171.7MB in the beginning and 146.9MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 20:21:04,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.77ms. Allocated memory is still 201.3MB. Free memory was 146.9MB in the beginning and 144.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:21:04,004 INFO L158 Benchmark]: Boogie Preprocessor took 58.93ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 142.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:21:04,004 INFO L158 Benchmark]: RCFGBuilder took 861.65ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 102.9MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-20 20:21:04,005 INFO L158 Benchmark]: TraceAbstraction took 20558.57ms. Allocated memory was 201.3MB in the beginning and 740.3MB in the end (delta: 539.0MB). Free memory was 102.5MB in the beginning and 181.8MB in the end (delta: -79.3MB). Peak memory consumption was 461.8MB. Max. memory is 16.1GB. [2022-11-20 20:21:04,005 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 740.3MB. Free memory was 181.8MB in the beginning and 180.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:21:04,007 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.16ms. Allocated memory is still 121.6MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.28ms. Allocated memory is still 201.3MB. Free memory was 171.7MB in the beginning and 146.9MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.77ms. Allocated memory is still 201.3MB. Free memory was 146.9MB in the beginning and 144.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.93ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 142.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 861.65ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 102.9MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20558.57ms. Allocated memory was 201.3MB in the beginning and 740.3MB in the end (delta: 539.0MB). Free memory was 102.5MB in the beginning and 181.8MB in the end (delta: -79.3MB). Peak memory consumption was 461.8MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 740.3MB. Free memory was 181.8MB in the beginning and 180.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 158 PlacesBefore, 56 PlacesAfterwards, 147 TransitionsBefore, 44 TransitionsAfterwards, 3626 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 138 TotalNumberOfCompositions, 10419 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4165, independent: 3946, independent conditional: 0, independent unconditional: 3946, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2356, independent: 2285, independent conditional: 0, independent unconditional: 2285, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2356, independent: 2250, independent conditional: 0, independent unconditional: 2250, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 106, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 810, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 744, dependent conditional: 0, dependent unconditional: 744, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4165, independent: 1661, independent conditional: 0, independent unconditional: 1661, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 2356, unknown conditional: 0, unknown unconditional: 2356] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-4, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-3, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1483; [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-2, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L748] 1 a = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L751] 1 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - UnprovableResult [Line: 849]: 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: 847]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 689 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 689 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1535 IncrementalHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 92 mSDtfsCounter, 1535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5494occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 1033 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 2010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 20:21:04,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9 --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 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:21:06,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:21:06,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:21:06,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:21:06,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:21:06,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:21:06,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:21:06,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:21:06,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:21:06,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:21:06,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:21:06,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:21:06,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:21:06,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:21:06,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:21:06,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:21:06,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:21:06,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:21:06,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:21:06,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:21:06,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:21:06,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:21:06,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:21:06,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:21:06,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:21:06,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:21:06,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:21:06,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:21:06,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:21:06,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:21:06,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:21:06,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:21:06,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:21:06,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:21:06,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:21:06,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:21:06,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:21:06,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:21:06,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:21:06,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:21:06,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:21:06,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-20 20:21:06,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:21:06,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:21:06,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:21:06,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:21:06,654 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:21:06,654 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:21:06,654 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:21:06,655 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:21:06,655 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:21:06,655 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:21:06,655 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:21:06,656 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:21:06,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:21:06,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:21:06,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:21:06,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:21:06,658 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:21:06,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:21:06,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:21:06,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:21:06,659 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:21:06,659 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:21:06,659 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:21:06,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:21:06,660 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:21:06,660 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 20:21:06,660 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 20:21:06,660 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:21:06,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:21:06,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:21:06,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 20:21:06,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:21:06,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:21:06,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:21:06,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:21:06,662 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-20 20:21:06,662 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 20:21:06,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:21:06,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 20:21:06,663 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_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/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_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9 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 -> 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 [2022-11-20 20:21:07,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:21:07,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:21:07,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:21:07,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:21:07,061 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:21:07,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2022-11-20 20:21:10,179 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:21:10,444 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:21:10,444 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2022-11-20 20:21:10,470 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data/d5567a749/42022465b9b746248cd90fb0aa16ce03/FLAGf577a2da8 [2022-11-20 20:21:10,485 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/data/d5567a749/42022465b9b746248cd90fb0aa16ce03 [2022-11-20 20:21:10,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:21:10,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:21:10,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:21:10,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:21:10,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:21:10,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:10" (1/1) ... [2022-11-20 20:21:10,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ba631f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:10, skipping insertion in model container [2022-11-20 20:21:10,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:10" (1/1) ... [2022-11-20 20:21:10,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:21:10,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:21:10,784 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_265cb97f-0765-411a-a8fd-6d608f5cffb4/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2022-11-20 20:21:11,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:21:11,022 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:21:11,034 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_265cb97f-0765-411a-a8fd-6d608f5cffb4/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2022-11-20 20:21:11,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:21:11,197 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:21:11,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11 WrapperNode [2022-11-20 20:21:11,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:21:11,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:21:11,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:21:11,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:21:11,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,292 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-11-20 20:21:11,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:21:11,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:21:11,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:21:11,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:21:11,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:21:11,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:21:11,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:21:11,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:21:11,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (1/1) ... [2022-11-20 20:21:11,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:21:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:11,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:21:11,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:21:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 20:21:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:21:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:21:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:21:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 20:21:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 20:21:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 20:21:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 20:21:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 20:21:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 20:21:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 20:21:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 20:21:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 20:21:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 20:21:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 20:21:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:21:11,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:21:11,482 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:21:11,699 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:21:11,705 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:21:12,184 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:21:12,351 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:21:12,351 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 20:21:12,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:12 BoogieIcfgContainer [2022-11-20 20:21:12,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:21:12,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:21:12,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:21:12,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:21:12,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:21:10" (1/3) ... [2022-11-20 20:21:12,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db3275f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:12, skipping insertion in model container [2022-11-20 20:21:12,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:11" (2/3) ... [2022-11-20 20:21:12,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db3275f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:12, skipping insertion in model container [2022-11-20 20:21:12,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:12" (3/3) ... [2022-11-20 20:21:12,371 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2022-11-20 20:21:12,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:21:12,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-20 20:21:12,391 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:21:12,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 20:21:12,540 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:21:12,572 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-20 20:21:12,579 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-20 20:21:12,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-20 20:21:12,681 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-20 20:21:12,682 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 20:21:12,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-20 20:21:12,693 INFO L119 LiptonReduction]: Number of co-enabled transitions 3626 [2022-11-20 20:21:23,702 INFO L134 LiptonReduction]: Checked pairs total: 10372 [2022-11-20 20:21:23,702 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-11-20 20:21:23,710 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-20 20:21:24,023 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5494 states, 5477 states have (on average 4.097316048931897) internal successors, (22441), 5493 states have internal predecessors, (22441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:24,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:21:24,053 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;@cf1789e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:21:24,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-20 20:21:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 5494 states, 5477 states have (on average 4.097316048931897) internal successors, (22441), 5493 states have internal predecessors, (22441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 20:21:24,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:24,078 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 20:21:24,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash 619, now seen corresponding path program 1 times [2022-11-20 20:21:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:24,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512016328] [2022-11-20 20:21:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:24,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:24,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:24,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:24,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 20:21:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:24,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 20:21:24,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:24,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:24,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:24,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512016328] [2022-11-20 20:21:24,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512016328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:24,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:24,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 20:21:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983590290] [2022-11-20 20:21:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:24,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 20:21:24,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:24,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 20:21:24,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:21:24,260 INFO L87 Difference]: Start difference. First operand has 5494 states, 5477 states have (on average 4.097316048931897) internal successors, (22441), 5493 states have internal predecessors, (22441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:24,579 INFO L93 Difference]: Finished difference Result 5122 states and 20483 transitions. [2022-11-20 20:21:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 20:21:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 20:21:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:24,746 INFO L225 Difference]: With dead ends: 5122 [2022-11-20 20:21:24,746 INFO L226 Difference]: Without dead ends: 5122 [2022-11-20 20:21:24,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:21:24,753 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:24,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:21:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2022-11-20 20:21:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 5122. [2022-11-20 20:21:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5122 states, 5117 states have (on average 4.002931405120187) internal successors, (20483), 5121 states have internal predecessors, (20483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 20483 transitions. [2022-11-20 20:21:25,173 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 20483 transitions. Word has length 1 [2022-11-20 20:21:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:25,174 INFO L495 AbstractCegarLoop]: Abstraction has 5122 states and 20483 transitions. [2022-11-20 20:21:25,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 20483 transitions. [2022-11-20 20:21:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:21:25,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:25,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:21:25,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/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-20 20:21:25,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:25,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 586516434, now seen corresponding path program 1 times [2022-11-20 20:21:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595700634] [2022-11-20 20:21:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:25,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:25,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:25,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 20:21:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:25,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:21:25,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:25,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:25,558 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:25,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595700634] [2022-11-20 20:21:25,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595700634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:25,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:25,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:21:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516403222] [2022-11-20 20:21:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:25,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:21:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:21:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:21:25,563 INFO L87 Difference]: Start difference. First operand 5122 states and 20483 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:25,769 INFO L93 Difference]: Finished difference Result 4187 states and 16550 transitions. [2022-11-20 20:21:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:21:25,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 20:21:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:25,807 INFO L225 Difference]: With dead ends: 4187 [2022-11-20 20:21:25,807 INFO L226 Difference]: Without dead ends: 4062 [2022-11-20 20:21:25,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:21:25,809 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:25,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:21:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-11-20 20:21:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-11-20 20:21:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4060 states have (on average 3.9716748768472905) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-11-20 20:21:26,075 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 5 [2022-11-20 20:21:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:26,076 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-11-20 20:21:26,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-11-20 20:21:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:21:26,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:26,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:26,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:26,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:26,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1262478582, now seen corresponding path program 1 times [2022-11-20 20:21:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:26,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315538677] [2022-11-20 20:21:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:26,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:26,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:26,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:26,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 20:21:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:26,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:21:26,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:26,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:26,504 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:26,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315538677] [2022-11-20 20:21:26,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315538677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:26,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:26,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:21:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175692163] [2022-11-20 20:21:26,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:26,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:21:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:21:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:21:26,510 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:26,852 INFO L93 Difference]: Finished difference Result 3407 states and 11981 transitions. [2022-11-20 20:21:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:21:26,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 20:21:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:26,892 INFO L225 Difference]: With dead ends: 3407 [2022-11-20 20:21:26,892 INFO L226 Difference]: Without dead ends: 2782 [2022-11-20 20:21:26,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:21:26,899 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:26,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 20 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2022-11-20 20:21:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2782. [2022-11-20 20:21:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2780 states have (on average 3.4982014388489207) internal successors, (9725), 2781 states have internal predecessors, (9725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 9725 transitions. [2022-11-20 20:21:27,165 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 9725 transitions. Word has length 11 [2022-11-20 20:21:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:27,167 INFO L495 AbstractCegarLoop]: Abstraction has 2782 states and 9725 transitions. [2022-11-20 20:21:27,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 9725 transitions. [2022-11-20 20:21:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:21:27,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:27,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:27,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:27,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:27,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1699052140, now seen corresponding path program 1 times [2022-11-20 20:21:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:27,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91952032] [2022-11-20 20:21:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:27,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:27,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:27,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 20:21:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:27,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:21:27,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:27,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:27,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:27,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91952032] [2022-11-20 20:21:27,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91952032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:27,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:27,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:21:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606216330] [2022-11-20 20:21:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:27,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:21:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:27,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:21:27,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:21:27,623 INFO L87 Difference]: Start difference. First operand 2782 states and 9725 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:27,935 INFO L93 Difference]: Finished difference Result 1871 states and 5837 transitions. [2022-11-20 20:21:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:21:27,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 20:21:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:27,945 INFO L225 Difference]: With dead ends: 1871 [2022-11-20 20:21:27,945 INFO L226 Difference]: Without dead ends: 1502 [2022-11-20 20:21:27,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:21:27,949 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:27,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-11-20 20:21:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2022-11-20 20:21:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1500 states have (on average 3.07) internal successors, (4605), 1501 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4605 transitions. [2022-11-20 20:21:28,067 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4605 transitions. Word has length 15 [2022-11-20 20:21:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:28,067 INFO L495 AbstractCegarLoop]: Abstraction has 1502 states and 4605 transitions. [2022-11-20 20:21:28,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4605 transitions. [2022-11-20 20:21:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:21:28,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:28,071 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-20 20:21:28,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:28,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:28,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:28,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -684622310, now seen corresponding path program 1 times [2022-11-20 20:21:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:28,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442844593] [2022-11-20 20:21:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:28,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:28,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:28,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:28,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 20:21:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:28,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 20:21:28,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:28,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:28,496 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:28,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442844593] [2022-11-20 20:21:28,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442844593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:28,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:28,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:21:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746991344] [2022-11-20 20:21:28,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:28,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:21:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:28,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:21:28,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:21:28,498 INFO L87 Difference]: Start difference. First operand 1502 states and 4605 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:28,869 INFO L93 Difference]: Finished difference Result 1135 states and 3469 transitions. [2022-11-20 20:21:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:21:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:21:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:28,874 INFO L225 Difference]: With dead ends: 1135 [2022-11-20 20:21:28,874 INFO L226 Difference]: Without dead ends: 1022 [2022-11-20 20:21:28,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:21:28,874 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 73 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:28,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 64 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-11-20 20:21:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2022-11-20 20:21:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1020 states have (on average 3.1029411764705883) internal successors, (3165), 1021 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3165 transitions. [2022-11-20 20:21:28,907 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 3165 transitions. Word has length 19 [2022-11-20 20:21:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:28,907 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 3165 transitions. [2022-11-20 20:21:28,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 3165 transitions. [2022-11-20 20:21:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:21:28,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:28,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:28,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:29,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:29,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1879082600, now seen corresponding path program 1 times [2022-11-20 20:21:29,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:29,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499465335] [2022-11-20 20:21:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:29,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:29,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:29,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:29,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 20:21:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:29,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 20:21:29,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:29,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:29,359 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:29,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499465335] [2022-11-20 20:21:29,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499465335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:29,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:29,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:21:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226169060] [2022-11-20 20:21:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:29,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:21:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:21:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:21:29,362 INFO L87 Difference]: Start difference. First operand 1022 states and 3165 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:29,877 INFO L93 Difference]: Finished difference Result 959 states and 3037 transitions. [2022-11-20 20:21:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:21:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 20:21:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:29,884 INFO L225 Difference]: With dead ends: 959 [2022-11-20 20:21:29,884 INFO L226 Difference]: Without dead ends: 942 [2022-11-20 20:21:29,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:21:29,888 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:29,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 96 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 20:21:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-11-20 20:21:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2022-11-20 20:21:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 3.1968085106382977) internal successors, (3005), 941 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 3005 transitions. [2022-11-20 20:21:29,920 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 3005 transitions. Word has length 23 [2022-11-20 20:21:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:29,921 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 3005 transitions. [2022-11-20 20:21:29,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 3005 transitions. [2022-11-20 20:21:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:21:29,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:29,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:29,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:30,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash -81436546, now seen corresponding path program 1 times [2022-11-20 20:21:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:30,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169528850] [2022-11-20 20:21:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:30,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:30,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:30,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 20:21:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:30,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:21:30,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:30,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:30,353 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:30,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169528850] [2022-11-20 20:21:30,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169528850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:30,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:30,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:21:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308354314] [2022-11-20 20:21:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:30,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:21:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:21:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:21:30,356 INFO L87 Difference]: Start difference. First operand 942 states and 3005 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:30,543 INFO L93 Difference]: Finished difference Result 1246 states and 3914 transitions. [2022-11-20 20:21:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:21:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-20 20:21:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:30,549 INFO L225 Difference]: With dead ends: 1246 [2022-11-20 20:21:30,549 INFO L226 Difference]: Without dead ends: 1246 [2022-11-20 20:21:30,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:21:30,550 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:30,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:21:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-11-20 20:21:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1244. [2022-11-20 20:21:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1242 states have (on average 3.150563607085346) internal successors, (3913), 1243 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3913 transitions. [2022-11-20 20:21:30,589 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3913 transitions. Word has length 27 [2022-11-20 20:21:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:30,589 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 3913 transitions. [2022-11-20 20:21:30,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3913 transitions. [2022-11-20 20:21:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:21:30,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:30,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:30,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:30,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:30,824 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash -335917442, now seen corresponding path program 2 times [2022-11-20 20:21:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:30,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752492682] [2022-11-20 20:21:30,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 20:21:30,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:30,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:30,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:30,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-20 20:21:31,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 20:21:31,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:21:31,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 20:21:31,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:31,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:31,549 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:31,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752492682] [2022-11-20 20:21:31,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752492682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:31,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:31,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:21:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531085234] [2022-11-20 20:21:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:31,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:21:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:21:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:21:31,552 INFO L87 Difference]: Start difference. First operand 1244 states and 3913 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:31,927 INFO L93 Difference]: Finished difference Result 1658 states and 5068 transitions. [2022-11-20 20:21:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:21:31,927 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-20 20:21:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:31,935 INFO L225 Difference]: With dead ends: 1658 [2022-11-20 20:21:31,935 INFO L226 Difference]: Without dead ends: 1658 [2022-11-20 20:21:31,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:21:31,936 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:31,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 37 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2022-11-20 20:21:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1236. [2022-11-20 20:21:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1234 states have (on average 3.1547811993517016) internal successors, (3893), 1235 states have internal predecessors, (3893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 3893 transitions. [2022-11-20 20:21:31,989 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 3893 transitions. Word has length 27 [2022-11-20 20:21:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:31,989 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 3893 transitions. [2022-11-20 20:21:31,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 3893 transitions. [2022-11-20 20:21:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:21:31,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:31,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:32,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:32,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:32,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 912517634, now seen corresponding path program 3 times [2022-11-20 20:21:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:32,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236822088] [2022-11-20 20:21:32,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:21:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:32,210 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:32,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 20:21:32,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 20:21:32,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:21:32,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 20:21:32,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:32,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:32,993 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:32,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236822088] [2022-11-20 20:21:32,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236822088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:32,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:32,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:21:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796286114] [2022-11-20 20:21:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:32,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:21:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:21:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:21:32,995 INFO L87 Difference]: Start difference. First operand 1236 states and 3893 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:33,305 INFO L93 Difference]: Finished difference Result 1614 states and 4934 transitions. [2022-11-20 20:21:33,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:21:33,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-20 20:21:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:33,311 INFO L225 Difference]: With dead ends: 1614 [2022-11-20 20:21:33,311 INFO L226 Difference]: Without dead ends: 1614 [2022-11-20 20:21:33,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:21:33,312 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 109 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:33,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 28 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-11-20 20:21:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1232. [2022-11-20 20:21:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1230 states have (on average 3.1552845528455284) internal successors, (3881), 1231 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 3881 transitions. [2022-11-20 20:21:33,350 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 3881 transitions. Word has length 27 [2022-11-20 20:21:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:33,350 INFO L495 AbstractCegarLoop]: Abstraction has 1232 states and 3881 transitions. [2022-11-20 20:21:33,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 3881 transitions. [2022-11-20 20:21:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:21:33,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:33,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:33,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:33,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:33,567 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:33,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2125624756, now seen corresponding path program 4 times [2022-11-20 20:21:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:33,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804859824] [2022-11-20 20:21:33,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:21:33,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:33,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:33,569 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:33,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-20 20:21:33,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:21:33,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:21:33,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 20:21:33,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:34,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:34,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:34,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804859824] [2022-11-20 20:21:34,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804859824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:34,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:34,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:21:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666287208] [2022-11-20 20:21:34,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:34,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:21:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:21:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:21:34,346 INFO L87 Difference]: Start difference. First operand 1232 states and 3881 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:34,673 INFO L93 Difference]: Finished difference Result 1610 states and 4922 transitions. [2022-11-20 20:21:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:21:34,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-20 20:21:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:34,679 INFO L225 Difference]: With dead ends: 1610 [2022-11-20 20:21:34,679 INFO L226 Difference]: Without dead ends: 1610 [2022-11-20 20:21:34,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:21:34,680 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:34,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 32 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-11-20 20:21:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1220. [2022-11-20 20:21:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1218 states have (on average 3.1568144499178983) internal successors, (3845), 1219 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 3845 transitions. [2022-11-20 20:21:34,728 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 3845 transitions. Word has length 27 [2022-11-20 20:21:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:34,728 INFO L495 AbstractCegarLoop]: Abstraction has 1220 states and 3845 transitions. [2022-11-20 20:21:34,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 3845 transitions. [2022-11-20 20:21:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:21:34,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:34,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:34,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:34,950 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash 268333370, now seen corresponding path program 5 times [2022-11-20 20:21:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:34,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164566904] [2022-11-20 20:21:34,952 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 20:21:34,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:34,954 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:35,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-20 20:21:35,145 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 20:21:35,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:21:35,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 20:21:35,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:35,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:21:35,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:21:35,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164566904] [2022-11-20 20:21:35,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164566904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:35,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:35,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:21:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363735255] [2022-11-20 20:21:35,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:35,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:21:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:21:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:21:35,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:21:35,849 INFO L87 Difference]: Start difference. First operand 1220 states and 3845 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:36,178 INFO L93 Difference]: Finished difference Result 1538 states and 4708 transitions. [2022-11-20 20:21:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:21:36,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-20 20:21:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:36,184 INFO L225 Difference]: With dead ends: 1538 [2022-11-20 20:21:36,184 INFO L226 Difference]: Without dead ends: 1538 [2022-11-20 20:21:36,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:21:36,185 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:36,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 33 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:21:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-20 20:21:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1214. [2022-11-20 20:21:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1212 states have (on average 3.155115511551155) internal successors, (3824), 1213 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3824 transitions. [2022-11-20 20:21:36,220 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3824 transitions. Word has length 27 [2022-11-20 20:21:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:36,221 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3824 transitions. [2022-11-20 20:21:36,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3824 transitions. [2022-11-20 20:21:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:21:36,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:36,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:36,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:36,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:36,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 20:21:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1878747902, now seen corresponding path program 6 times [2022-11-20 20:21:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:21:36,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973699173] [2022-11-20 20:21:36,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 20:21:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:21:36,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:21:36,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-20 20:21:36,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-20 20:21:36,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 20:21:36,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:21:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:21:36,774 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-20 20:21:36,774 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:21:36,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-20 20:21:36,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-20 20:21:36,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-20 20:21:36,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-20 20:21:36,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-20 20:21:36,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-20 20:21:36,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-20 20:21:36,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-20 20:21:36,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-20 20:21:36,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-20 20:21:36,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-20 20:21:36,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-20 20:21:36,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-20 20:21:36,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-20 20:21:36,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-20 20:21:36,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-20 20:21:36,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:36,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:21:36,994 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:37,000 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 20:21:37,000 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:21:37,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:21:37 BasicIcfg [2022-11-20 20:21:37,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:21:37,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:21:37,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:21:37,134 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:21:37,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:12" (3/4) ... [2022-11-20 20:21:37,137 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 20:21:37,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:21:37,138 INFO L158 Benchmark]: Toolchain (without parser) took 26646.07ms. Allocated memory was 73.4MB in the beginning and 427.8MB in the end (delta: 354.4MB). Free memory was 47.8MB in the beginning and 158.5MB in the end (delta: -110.7MB). Peak memory consumption was 247.3MB. Max. memory is 16.1GB. [2022-11-20 20:21:37,138 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 73.4MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:21:37,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.14ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 47.6MB in the beginning and 63.7MB in the end (delta: -16.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-20 20:21:37,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.72ms. Allocated memory is still 92.3MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:21:37,139 INFO L158 Benchmark]: Boogie Preprocessor took 78.44ms. Allocated memory is still 92.3MB. Free memory was 60.9MB in the beginning and 58.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:21:37,140 INFO L158 Benchmark]: RCFGBuilder took 975.89ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 65.1MB in the end (delta: -6.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-11-20 20:21:37,141 INFO L158 Benchmark]: TraceAbstraction took 24774.54ms. Allocated memory was 92.3MB in the beginning and 427.8MB in the end (delta: 335.5MB). Free memory was 64.6MB in the beginning and 158.5MB in the end (delta: -93.9MB). Peak memory consumption was 243.6MB. Max. memory is 16.1GB. [2022-11-20 20:21:37,141 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 427.8MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:21:37,143 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.93ms. Allocated memory is still 73.4MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.14ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 47.6MB in the beginning and 63.7MB in the end (delta: -16.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.72ms. Allocated memory is still 92.3MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.44ms. Allocated memory is still 92.3MB. Free memory was 60.9MB in the beginning and 58.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 975.89ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 65.1MB in the end (delta: -6.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24774.54ms. Allocated memory was 92.3MB in the beginning and 427.8MB in the end (delta: 335.5MB). Free memory was 64.6MB in the beginning and 158.5MB in the end (delta: -93.9MB). Peak memory consumption was 243.6MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 427.8MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 159 PlacesBefore, 56 PlacesAfterwards, 148 TransitionsBefore, 44 TransitionsAfterwards, 3626 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 10372 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4561, independent: 4337, independent conditional: 0, independent unconditional: 4337, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2532, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2532, independent: 2391, independent conditional: 0, independent unconditional: 2391, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 141, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 938, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 850, dependent conditional: 0, dependent unconditional: 850, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4561, independent: 1894, independent conditional: 0, independent unconditional: 1894, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 2532, unknown conditional: 0, unknown unconditional: 2532] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 294, Positive conditional cache size: 0, Positive unconditional cache size: 294, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-1, t1481={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=0, t1481={11:0}, t1482={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=1, t1481={11:0}, t1482={15:0}, t1483={9:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1484; [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=2, t1481={11:0}, t1482={15:0}, t1483={9:0}, t1484={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L748] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L751] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={11:0}, t1482={15:0}, t1483={9:0}, t1484={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - UnprovableResult [Line: 849]: 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: 847]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 642 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2060 IncrementalHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 109 mSDtfsCounter, 2060 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5494occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1520 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 2358 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1736 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 20:21:37,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_265cb97f-0765-411a-a8fd-6d608f5cffb4/bin/utaipan-6cKwYrpEi9/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