./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2eb21c2f62b942207daf3883fd6861e716746fcd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:02:24,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:02:24,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:02:24,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:02:24,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:02:24,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:02:24,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:02:24,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:02:24,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:02:24,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:02:24,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:02:24,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:02:24,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:02:24,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:02:24,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:02:24,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:02:24,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:02:24,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:02:24,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:02:24,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:02:24,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:02:24,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:02:24,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:02:24,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:02:24,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:02:24,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:02:24,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:02:24,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:02:24,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:02:24,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:02:24,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:02:24,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:02:24,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:02:24,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:02:24,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:02:24,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:02:24,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:02:24,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:02:24,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:02:24,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:02:24,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:02:24,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:02:24,783 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:02:24,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:02:24,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:02:24,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:02:24,785 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:02:24,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:02:24,786 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:02:24,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:02:24,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:02:24,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:02:24,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:02:24,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:02:24,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:02:24,787 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:02:24,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:02:24,792 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:02:24,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:02:24,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:02:24,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:02:24,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:02:24,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:02:24,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:02:24,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:02:24,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:02:24,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:02:24,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:02:24,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:02:24,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:02:24,796 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:02:24,796 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-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/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-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2eb21c2f62b942207daf3883fd6861e716746fcd [2020-11-30 01:02:25,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:02:25,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:02:25,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:02:25,134 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:02:25,137 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:02:25,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i [2020-11-30 01:02:25,242 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/data/0fa25140d/443948bb38e84d9a90ed5f1533db48f6/FLAG759baa9e2 [2020-11-30 01:02:25,783 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:02:25,783 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i [2020-11-30 01:02:25,804 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/data/0fa25140d/443948bb38e84d9a90ed5f1533db48f6/FLAG759baa9e2 [2020-11-30 01:02:26,076 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/data/0fa25140d/443948bb38e84d9a90ed5f1533db48f6 [2020-11-30 01:02:26,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:02:26,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:02:26,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:02:26,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:02:26,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:02:26,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f12e9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26, skipping insertion in model container [2020-11-30 01:02:26,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:02:26,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:02:26,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:02:26,651 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:02:26,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:02:26,831 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:02:26,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26 WrapperNode [2020-11-30 01:02:26,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:02:26,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:02:26,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:02:26,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:02:26,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:02:26,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:02:26,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:02:26,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:02:26,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:26,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... [2020-11-30 01:02:27,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:02:27,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:02:27,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:02:27,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:02:27,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:02:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:02:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 01:02:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:02:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:02:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 01:02:27,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 01:02:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 01:02:27,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 01:02:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 01:02:27,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 01:02:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:02:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 01:02:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:02:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:02:27,127 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 01:02:29,611 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:02:29,611 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 01:02:29,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:02:29 BoogieIcfgContainer [2020-11-30 01:02:29,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:02:29,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:02:29,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:02:29,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:02:29,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:02:26" (1/3) ... [2020-11-30 01:02:29,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b94f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:02:29, skipping insertion in model container [2020-11-30 01:02:29,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:02:26" (2/3) ... [2020-11-30 01:02:29,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b94f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:02:29, skipping insertion in model container [2020-11-30 01:02:29,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:02:29" (3/3) ... [2020-11-30 01:02:29,621 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_rmo.oepc.i [2020-11-30 01:02:29,631 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 01:02:29,631 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:02:29,637 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 01:02:29,638 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 01:02:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,682 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,683 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,683 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,689 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,690 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,693 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,725 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:02:29,740 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 01:02:29,751 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-30 01:02:29,771 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:02:29,771 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:02:29,771 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:02:29,772 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:02:29,772 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:02:29,772 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:02:29,772 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:02:29,772 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:02:29,783 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 01:02:29,785 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 102 transitions, 219 flow [2020-11-30 01:02:29,788 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 102 transitions, 219 flow [2020-11-30 01:02:29,790 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 109 places, 102 transitions, 219 flow [2020-11-30 01:02:29,833 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2020-11-30 01:02:29,833 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 01:02:29,836 INFO L80 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-11-30 01:02:29,840 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-11-30 01:02:30,326 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-30 01:02:30,457 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-30 01:02:30,664 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-30 01:02:30,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:02:30,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:30,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:02:30,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:30,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:02:30,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:30,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:02:30,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:31,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:02:31,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:02:31,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:31,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:31,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:31,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:31,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:31,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 01:02:31,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:02:31,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:31,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:31,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:31,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:31,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:31,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:31,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:02:31,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:31,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:31,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:31,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:32,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:02:32,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:32,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:32,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:32,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:32,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:32,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:32,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:32,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:32,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:02:32,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:32,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:32,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:32,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:32,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:32,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:32,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 01:02:32,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:02:32,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:32,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:32,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:32,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:32,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:32,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,157 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-30 01:02:33,265 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-30 01:02:33,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 01:02:33,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:02:33,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:33,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:33,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:33,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:02:33,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:33,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:33,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:33,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:33,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:33,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:33,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:02:33,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:02:33,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:33,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:33,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:34,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:02:34,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 01:02:34,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:02:34,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:34,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:34,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:34,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:34,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:34,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:34,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:34,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:34,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:02:34,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:34,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:34,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:34,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:02:34,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:02:34,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:34,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:02:34,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:02:34,850 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-30 01:02:35,059 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-30 01:02:35,071 INFO L131 LiptonReduction]: Checked pairs total: 4904 [2020-11-30 01:02:35,071 INFO L133 LiptonReduction]: Total number of compositions: 90 [2020-11-30 01:02:35,078 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-30 01:02:35,134 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-11-30 01:02:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-11-30 01:02:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-30 01:02:35,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:35,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-30 01:02:35,141 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:35,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1092353, now seen corresponding path program 1 times [2020-11-30 01:02:35,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:35,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594970560] [2020-11-30 01:02:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:35,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594970560] [2020-11-30 01:02:35,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:35,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 01:02:35,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048564536] [2020-11-30 01:02:35,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:02:35,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:35,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:02:35,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:02:35,379 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-11-30 01:02:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:35,538 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-11-30 01:02:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:02:35,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-30 01:02:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:35,572 INFO L225 Difference]: With dead ends: 812 [2020-11-30 01:02:35,572 INFO L226 Difference]: Without dead ends: 687 [2020-11-30 01:02:35,573 INFO L677 BasicCegarLoop]: 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 [2020-11-30 01:02:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-11-30 01:02:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-11-30 01:02:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-11-30 01:02:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-11-30 01:02:35,692 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-11-30 01:02:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:35,693 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-11-30 01:02:35,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:02:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-11-30 01:02:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:02:35,696 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:35,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:35,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:02:35,697 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash 681382506, now seen corresponding path program 1 times [2020-11-30 01:02:35,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:35,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233741266] [2020-11-30 01:02:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:35,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233741266] [2020-11-30 01:02:35,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:35,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:02:35,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921502761] [2020-11-30 01:02:35,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:02:35,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:02:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:02:35,894 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-11-30 01:02:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:35,946 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-11-30 01:02:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:02:35,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 01:02:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:35,953 INFO L225 Difference]: With dead ends: 792 [2020-11-30 01:02:35,953 INFO L226 Difference]: Without dead ends: 667 [2020-11-30 01:02:35,954 INFO L677 BasicCegarLoop]: 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 [2020-11-30 01:02:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-11-30 01:02:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-11-30 01:02:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-11-30 01:02:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-11-30 01:02:36,017 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-11-30 01:02:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:36,018 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-11-30 01:02:36,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:02:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-11-30 01:02:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:02:36,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:36,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:36,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:02:36,029 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:36,032 INFO L82 PathProgramCache]: Analyzing trace with hash -351948821, now seen corresponding path program 1 times [2020-11-30 01:02:36,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:36,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937795172] [2020-11-30 01:02:36,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:36,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937795172] [2020-11-30 01:02:36,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:36,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:02:36,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478212643] [2020-11-30 01:02:36,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:02:36,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:02:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:02:36,136 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-11-30 01:02:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:36,174 INFO L93 Difference]: Finished difference Result 552 states and 1478 transitions. [2020-11-30 01:02:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:02:36,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-30 01:02:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:36,178 INFO L225 Difference]: With dead ends: 552 [2020-11-30 01:02:36,179 INFO L226 Difference]: Without dead ends: 427 [2020-11-30 01:02:36,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:02:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-30 01:02:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-11-30 01:02:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-30 01:02:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1114 transitions. [2020-11-30 01:02:36,197 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1114 transitions. Word has length 11 [2020-11-30 01:02:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:36,197 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1114 transitions. [2020-11-30 01:02:36,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:02:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1114 transitions. [2020-11-30 01:02:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:02:36,199 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:36,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:36,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:02:36,200 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:36,201 INFO L82 PathProgramCache]: Analyzing trace with hash -305672866, now seen corresponding path program 1 times [2020-11-30 01:02:36,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:36,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388084967] [2020-11-30 01:02:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:36,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388084967] [2020-11-30 01:02:36,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:36,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:02:36,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990372903] [2020-11-30 01:02:36,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:02:36,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:02:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:02:36,350 INFO L87 Difference]: Start difference. First operand 427 states and 1114 transitions. Second operand 4 states. [2020-11-30 01:02:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:36,390 INFO L93 Difference]: Finished difference Result 688 states and 1719 transitions. [2020-11-30 01:02:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:02:36,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-30 01:02:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:36,394 INFO L225 Difference]: With dead ends: 688 [2020-11-30 01:02:36,394 INFO L226 Difference]: Without dead ends: 461 [2020-11-30 01:02:36,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:02:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2020-11-30 01:02:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 413. [2020-11-30 01:02:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-11-30 01:02:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1030 transitions. [2020-11-30 01:02:36,424 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1030 transitions. Word has length 14 [2020-11-30 01:02:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:36,425 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 1030 transitions. [2020-11-30 01:02:36,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:02:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1030 transitions. [2020-11-30 01:02:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:02:36,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:36,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:36,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:02:36,427 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:36,427 INFO L82 PathProgramCache]: Analyzing trace with hash 39891264, now seen corresponding path program 1 times [2020-11-30 01:02:36,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:36,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969402632] [2020-11-30 01:02:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:36,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969402632] [2020-11-30 01:02:36,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:36,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:02:36,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295807796] [2020-11-30 01:02:36,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:02:36,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:36,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:02:36,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:02:36,527 INFO L87 Difference]: Start difference. First operand 413 states and 1030 transitions. Second operand 5 states. [2020-11-30 01:02:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:36,600 INFO L93 Difference]: Finished difference Result 298 states and 664 transitions. [2020-11-30 01:02:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:02:36,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 01:02:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:36,604 INFO L225 Difference]: With dead ends: 298 [2020-11-30 01:02:36,604 INFO L226 Difference]: Without dead ends: 237 [2020-11-30 01:02:36,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:02:36,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-11-30 01:02:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-11-30 01:02:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-11-30 01:02:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 516 transitions. [2020-11-30 01:02:36,614 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 516 transitions. Word has length 14 [2020-11-30 01:02:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:36,615 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 516 transitions. [2020-11-30 01:02:36,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:02:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 516 transitions. [2020-11-30 01:02:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:02:36,616 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:36,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:36,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:02:36,617 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1829556788, now seen corresponding path program 1 times [2020-11-30 01:02:36,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:36,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977920781] [2020-11-30 01:02:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:36,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977920781] [2020-11-30 01:02:36,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:36,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:02:36,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868035787] [2020-11-30 01:02:36,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:02:36,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:02:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:02:36,759 INFO L87 Difference]: Start difference. First operand 237 states and 516 transitions. Second operand 6 states. [2020-11-30 01:02:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:36,814 INFO L93 Difference]: Finished difference Result 204 states and 449 transitions. [2020-11-30 01:02:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:02:36,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-30 01:02:36,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:36,816 INFO L225 Difference]: With dead ends: 204 [2020-11-30 01:02:36,816 INFO L226 Difference]: Without dead ends: 135 [2020-11-30 01:02:36,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:02:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-30 01:02:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-11-30 01:02:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-30 01:02:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 294 transitions. [2020-11-30 01:02:36,819 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 294 transitions. Word has length 18 [2020-11-30 01:02:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:36,819 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 294 transitions. [2020-11-30 01:02:36,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:02:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 294 transitions. [2020-11-30 01:02:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:02:36,820 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:36,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:36,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:02:36,821 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash 977420287, now seen corresponding path program 1 times [2020-11-30 01:02:36,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:36,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16744009] [2020-11-30 01:02:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:37,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16744009] [2020-11-30 01:02:37,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:37,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:02:37,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978064725] [2020-11-30 01:02:37,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:02:37,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:02:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:02:37,003 INFO L87 Difference]: Start difference. First operand 135 states and 294 transitions. Second operand 6 states. [2020-11-30 01:02:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:37,150 INFO L93 Difference]: Finished difference Result 186 states and 401 transitions. [2020-11-30 01:02:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:02:37,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-30 01:02:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:37,152 INFO L225 Difference]: With dead ends: 186 [2020-11-30 01:02:37,152 INFO L226 Difference]: Without dead ends: 103 [2020-11-30 01:02:37,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:02:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-30 01:02:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-11-30 01:02:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-30 01:02:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 214 transitions. [2020-11-30 01:02:37,156 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 214 transitions. Word has length 22 [2020-11-30 01:02:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:37,156 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 214 transitions. [2020-11-30 01:02:37,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:02:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 214 transitions. [2020-11-30 01:02:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:02:37,157 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:37,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:37,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:02:37,158 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1268476437, now seen corresponding path program 2 times [2020-11-30 01:02:37,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:37,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476352617] [2020-11-30 01:02:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:37,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476352617] [2020-11-30 01:02:37,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:02:37,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:02:37,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001657051] [2020-11-30 01:02:37,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:02:37,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:02:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:02:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:02:37,470 INFO L87 Difference]: Start difference. First operand 103 states and 214 transitions. Second operand 8 states. [2020-11-30 01:02:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:02:37,630 INFO L93 Difference]: Finished difference Result 124 states and 250 transitions. [2020-11-30 01:02:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:02:37,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-30 01:02:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:02:37,631 INFO L225 Difference]: With dead ends: 124 [2020-11-30 01:02:37,631 INFO L226 Difference]: Without dead ends: 63 [2020-11-30 01:02:37,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:02:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-30 01:02:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-30 01:02:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-30 01:02:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-11-30 01:02:37,634 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2020-11-30 01:02:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:02:37,634 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-11-30 01:02:37,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:02:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-11-30 01:02:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:02:37,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:02:37,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:02:37,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:02:37,636 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:02:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:02:37,636 INFO L82 PathProgramCache]: Analyzing trace with hash 762027051, now seen corresponding path program 3 times [2020-11-30 01:02:37,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:02:37,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144368543] [2020-11-30 01:02:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:02:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:02:37,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:02:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:02:37,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:02:37,850 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:02:37,850 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:02:37,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:02:37,876 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,876 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [742] [2020-11-30 01:02:37,881 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,894 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,894 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,894 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,896 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,896 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,896 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,896 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,897 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,898 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,898 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,898 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,899 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:02:37 BasicIcfg [2020-11-30 01:02:37,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:02:37,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:02:37,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:02:37,976 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:02:37,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:02:29" (3/4) ... [2020-11-30 01:02:37,978 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:02:37,994 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,994 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [742] [2020-11-30 01:02:37,995 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,995 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,995 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,997 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,997 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,997 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,997 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,998 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,998 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,998 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,998 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,999 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,999 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:37,999 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:37,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,000 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,000 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,000 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,010 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:02:38,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:02:38,121 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aa940930-30f5-48b7-a45e-433a2ee66242/bin/uautomizer/witness.graphml [2020-11-30 01:02:38,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:02:38,123 INFO L168 Benchmark]: Toolchain (without parser) took 12039.99 ms. Allocated memory was 92.3 MB in the beginning and 285.2 MB in the end (delta: 192.9 MB). Free memory was 57.7 MB in the beginning and 136.0 MB in the end (delta: -78.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:02:38,123 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 75.5 MB. Free memory was 55.0 MB in the beginning and 55.0 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:02:38,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.12 ms. Allocated memory is still 92.3 MB. Free memory was 57.6 MB in the beginning and 45.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:02:38,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.50 ms. Allocated memory is still 92.3 MB. Free memory was 45.8 MB in the beginning and 43.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:02:38,129 INFO L168 Benchmark]: Boogie Preprocessor took 70.99 ms. Allocated memory is still 92.3 MB. Free memory was 43.4 MB in the beginning and 41.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:02:38,130 INFO L168 Benchmark]: RCFGBuilder took 2610.07 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 41.0 MB in the beginning and 45.0 MB in the end (delta: -4.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:02:38,130 INFO L168 Benchmark]: TraceAbstraction took 8360.28 ms. Allocated memory was 111.1 MB in the beginning and 285.2 MB in the end (delta: 174.1 MB). Free memory was 45.0 MB in the beginning and 156.0 MB in the end (delta: -111.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:02:38,131 INFO L168 Benchmark]: Witness Printer took 145.71 ms. Allocated memory is still 285.2 MB. Free memory was 156.0 MB in the beginning and 136.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:02:38,133 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.34 ms. Allocated memory is still 75.5 MB. Free memory was 55.0 MB in the beginning and 55.0 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 746.12 ms. Allocated memory is still 92.3 MB. Free memory was 57.6 MB in the beginning and 45.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.50 ms. Allocated memory is still 92.3 MB. Free memory was 45.8 MB in the beginning and 43.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.99 ms. Allocated memory is still 92.3 MB. Free memory was 43.4 MB in the beginning and 41.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2610.07 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 41.0 MB in the beginning and 45.0 MB in the end (delta: -4.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8360.28 ms. Allocated memory was 111.1 MB in the beginning and 285.2 MB in the end (delta: 174.1 MB). Free memory was 45.0 MB in the beginning and 156.0 MB in the end (delta: -111.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 16.1 GB. * Witness Printer took 145.71 ms. Allocated memory is still 285.2 MB. Free memory was 156.0 MB in the beginning and 136.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1348 VarBasedMoverChecksPositive, 72 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 175 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.2s, 109 PlacesBefore, 37 PlacesAfterwards, 102 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 4904 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1397; [L834] FCALL, FORK 0 pthread_create(&t1397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1398; [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t1398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1399; [L838] FCALL, FORK 0 pthread_create(&t1399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L792] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L803] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 218 SDtfs, 325 SDslu, 423 SDs, 0 SdLazy, 168 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 8626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...