./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_tso.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_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/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 66ab76da4e49efdafe0b797e5286ec4c574180a4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-28 03:08:17,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:08:17,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:08:17,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:08:17,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:08:17,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:08:17,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:08:17,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:08:17,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:08:17,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:08:17,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:08:17,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:08:17,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:08:17,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:08:17,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:08:17,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:08:17,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:08:17,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:08:17,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:08:17,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:08:17,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:08:17,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:08:17,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:08:17,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:08:17,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:08:17,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:08:17,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:08:17,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:08:17,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:08:17,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:08:17,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:08:17,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:08:17,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:08:17,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:08:17,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:08:17,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:08:17,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:08:17,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:08:17,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:08:17,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:08:17,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:08:17,690 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:08:17,726 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:08:17,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:08:17,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:08:17,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:08:17,728 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:08:17,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:08:17,728 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:08:17,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:08:17,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:08:17,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:08:17,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:08:17,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:08:17,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:08:17,730 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:08:17,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:08:17,730 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:08:17,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:08:17,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:08:17,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:08:17,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:08:17,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:08:17,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:08:17,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:08:17,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:08:17,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:08:17,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:08:17,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:08:17,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:08:17,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:08:17,733 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_65c2b043-948c-4e7f-9672-8a28a1f5f223/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_65c2b043-948c-4e7f-9672-8a28a1f5f223/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 -> 66ab76da4e49efdafe0b797e5286ec4c574180a4 [2020-11-28 03:08:17,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:08:17,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:08:17,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:08:17,994 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:08:17,995 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:08:17,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2020-11-28 03:08:18,063 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/data/49d0619c3/975326119f1c4060980d1280d8b9c0c1/FLAG0c04faaab [2020-11-28 03:08:18,676 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:08:18,676 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2020-11-28 03:08:18,701 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/data/49d0619c3/975326119f1c4060980d1280d8b9c0c1/FLAG0c04faaab [2020-11-28 03:08:18,948 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/data/49d0619c3/975326119f1c4060980d1280d8b9c0c1 [2020-11-28 03:08:18,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:08:18,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:08:18,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:08:18,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:08:18,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:08:18,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:08:18" (1/1) ... [2020-11-28 03:08:18,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8020b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:18, skipping insertion in model container [2020-11-28 03:08:18,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:08:18" (1/1) ... [2020-11-28 03:08:18,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:08:19,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:08:19,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:08:19,485 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:08:19,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:08:19,665 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:08:19,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19 WrapperNode [2020-11-28 03:08:19,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:08:19,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:08:19,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:08:19,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:08:19,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:08:19,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:08:19,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:08:19,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:08:19,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... [2020-11-28 03:08:19,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:08:19,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:08:19,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:08:19,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:08:19,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/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-28 03:08:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:08:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:08:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:08:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:08:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:08:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:08:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:08:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:08:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:08:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:08:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 03:08:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 03:08:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:08:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:08:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:08:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:08:19,850 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 03:08:22,380 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:08:22,380 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:08:22,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:08:22 BoogieIcfgContainer [2020-11-28 03:08:22,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:08:22,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:08:22,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:08:22,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:08:22,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:08:18" (1/3) ... [2020-11-28 03:08:22,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f3bc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:08:22, skipping insertion in model container [2020-11-28 03:08:22,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:08:19" (2/3) ... [2020-11-28 03:08:22,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f3bc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:08:22, skipping insertion in model container [2020-11-28 03:08:22,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:08:22" (3/3) ... [2020-11-28 03:08:22,393 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2020-11-28 03:08:22,408 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:08:22,408 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:08:22,413 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:08:22,414 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:08:22,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,459 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,459 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,478 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,482 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,482 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,488 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:08:22,491 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:08:22,503 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 03:08:22,524 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:08:22,525 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:08:22,525 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:08:22,525 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:08:22,525 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:08:22,525 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:08:22,526 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:08:22,526 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:08:22,539 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:08:22,543 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 118 transitions, 256 flow [2020-11-28 03:08:22,547 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 118 transitions, 256 flow [2020-11-28 03:08:22,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 128 places, 118 transitions, 256 flow [2020-11-28 03:08:22,618 INFO L129 PetriNetUnfolder]: 3/114 cut-off events. [2020-11-28 03:08:22,618 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:08:22,623 INFO L80 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-11-28 03:08:22,628 INFO L116 LiptonReduction]: Number of co-enabled transitions 2754 [2020-11-28 03:08:22,949 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-28 03:08:23,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:23,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:23,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:23,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:23,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:08:23,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:23,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:08:23,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:23,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:23,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:23,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:23,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:23,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:23,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:23,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:08:23,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:23,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:23,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:23,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:23,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:23,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:23,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:23,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:23,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:23,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:23,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:08:23,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:23,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:24,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:24,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:24,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:24,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:24,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:24,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:24,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:24,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:24,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:08:24,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:24,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:24,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:24,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-28 03:08:24,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:24,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:24,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:24,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:24,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:24,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:24,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:24,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:24,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:24,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:08:24,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:24,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:24,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:24,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:24,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:24,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:25,851 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-28 03:08:25,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-28 03:08:25,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:25,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:25,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:26,643 WARN L193 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-11-28 03:08:26,921 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 03:08:27,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:27,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:27,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:08:27,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:27,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:27,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:27,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:27,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:08:27,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:27,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:08:27,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:27,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:27,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:08:27,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:08:27,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-28 03:08:27,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:27,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:08:27,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:08:27,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-28 03:08:27,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:27,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:08:27,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:08:27,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:08:27,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:08:27,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:28,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:08:28,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:28,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:08:28,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:08:29,193 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-28 03:08:29,542 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-28 03:08:29,652 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-28 03:08:30,195 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-28 03:08:30,397 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-28 03:08:30,426 INFO L131 LiptonReduction]: Checked pairs total: 7788 [2020-11-28 03:08:30,426 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-28 03:08:30,430 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-28 03:08:30,712 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-28 03:08:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-28 03:08:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 03:08:30,721 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:30,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:30,723 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash 488261609, now seen corresponding path program 1 times [2020-11-28 03:08:30,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:30,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096687874] [2020-11-28 03:08:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:31,065 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-28 03:08:31,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096687874] [2020-11-28 03:08:31,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:31,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:08:31,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352754088] [2020-11-28 03:08:31,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:08:31,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:08:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:08:31,094 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-28 03:08:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:31,240 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-28 03:08:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:08:31,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 03:08:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:31,289 INFO L225 Difference]: With dead ends: 3250 [2020-11-28 03:08:31,289 INFO L226 Difference]: Without dead ends: 2750 [2020-11-28 03:08:31,290 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-28 03:08:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2020-11-28 03:08:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2020-11-28 03:08:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2020-11-28 03:08:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 10663 transitions. [2020-11-28 03:08:31,502 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 10663 transitions. Word has length 7 [2020-11-28 03:08:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:31,504 INFO L481 AbstractCegarLoop]: Abstraction has 2750 states and 10663 transitions. [2020-11-28 03:08:31,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:08:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 10663 transitions. [2020-11-28 03:08:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:08:31,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:31,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:31,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:08:31,509 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1532014145, now seen corresponding path program 1 times [2020-11-28 03:08:31,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:31,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106483599] [2020-11-28 03:08:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:31,741 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-28 03:08:31,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106483599] [2020-11-28 03:08:31,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:31,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:08:31,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652372559] [2020-11-28 03:08:31,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:08:31,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:31,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:08:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:08:31,744 INFO L87 Difference]: Start difference. First operand 2750 states and 10663 transitions. Second operand 5 states. [2020-11-28 03:08:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:31,916 INFO L93 Difference]: Finished difference Result 3230 states and 12152 transitions. [2020-11-28 03:08:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:08:31,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 03:08:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:31,945 INFO L225 Difference]: With dead ends: 3230 [2020-11-28 03:08:31,945 INFO L226 Difference]: Without dead ends: 2730 [2020-11-28 03:08:31,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2020-11-28 03:08:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2730. [2020-11-28 03:08:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-11-28 03:08:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10567 transitions. [2020-11-28 03:08:32,132 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10567 transitions. Word has length 12 [2020-11-28 03:08:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:32,133 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10567 transitions. [2020-11-28 03:08:32,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:08:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10567 transitions. [2020-11-28 03:08:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:08:32,139 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:32,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:32,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:08:32,140 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:32,151 INFO L82 PathProgramCache]: Analyzing trace with hash 870868969, now seen corresponding path program 1 times [2020-11-28 03:08:32,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:32,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650342398] [2020-11-28 03:08:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:32,330 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-28 03:08:32,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650342398] [2020-11-28 03:08:32,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:32,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:08:32,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150952779] [2020-11-28 03:08:32,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:08:32,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:32,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:08:32,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:08:32,389 INFO L87 Difference]: Start difference. First operand 2730 states and 10567 transitions. Second operand 5 states. [2020-11-28 03:08:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:32,553 INFO L93 Difference]: Finished difference Result 3120 states and 11724 transitions. [2020-11-28 03:08:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:08:32,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 03:08:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:32,582 INFO L225 Difference]: With dead ends: 3120 [2020-11-28 03:08:32,582 INFO L226 Difference]: Without dead ends: 2670 [2020-11-28 03:08:32,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2020-11-28 03:08:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2670. [2020-11-28 03:08:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-11-28 03:08:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 10299 transitions. [2020-11-28 03:08:32,697 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 10299 transitions. Word has length 13 [2020-11-28 03:08:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:32,697 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 10299 transitions. [2020-11-28 03:08:32,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:08:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 10299 transitions. [2020-11-28 03:08:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:08:32,700 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:32,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:32,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:08:32,700 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash 245919980, now seen corresponding path program 1 times [2020-11-28 03:08:32,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:32,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979674125] [2020-11-28 03:08:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:32,867 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-28 03:08:32,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979674125] [2020-11-28 03:08:32,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:32,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:08:32,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278940934] [2020-11-28 03:08:32,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:08:32,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:32,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:08:32,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:32,869 INFO L87 Difference]: Start difference. First operand 2670 states and 10299 transitions. Second operand 6 states. [2020-11-28 03:08:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:33,190 INFO L93 Difference]: Finished difference Result 3138 states and 11831 transitions. [2020-11-28 03:08:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:08:33,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-28 03:08:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:33,296 INFO L225 Difference]: With dead ends: 3138 [2020-11-28 03:08:33,296 INFO L226 Difference]: Without dead ends: 2726 [2020-11-28 03:08:33,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:08:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2020-11-28 03:08:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2694. [2020-11-28 03:08:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2694 states. [2020-11-28 03:08:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 10389 transitions. [2020-11-28 03:08:33,424 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 10389 transitions. Word has length 13 [2020-11-28 03:08:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:33,425 INFO L481 AbstractCegarLoop]: Abstraction has 2694 states and 10389 transitions. [2020-11-28 03:08:33,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:08:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 10389 transitions. [2020-11-28 03:08:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:08:33,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:33,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:33,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:08:33,427 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:33,428 INFO L82 PathProgramCache]: Analyzing trace with hash 247765100, now seen corresponding path program 2 times [2020-11-28 03:08:33,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:33,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220879286] [2020-11-28 03:08:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:33,539 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-28 03:08:33,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220879286] [2020-11-28 03:08:33,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:33,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:08:33,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683245713] [2020-11-28 03:08:33,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:08:33,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:33,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:08:33,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:08:33,541 INFO L87 Difference]: Start difference. First operand 2694 states and 10389 transitions. Second operand 5 states. [2020-11-28 03:08:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:33,655 INFO L93 Difference]: Finished difference Result 3014 states and 11305 transitions. [2020-11-28 03:08:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:08:33,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 03:08:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:33,697 INFO L225 Difference]: With dead ends: 3014 [2020-11-28 03:08:33,698 INFO L226 Difference]: Without dead ends: 2614 [2020-11-28 03:08:33,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2020-11-28 03:08:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2614. [2020-11-28 03:08:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2020-11-28 03:08:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 10025 transitions. [2020-11-28 03:08:33,863 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 10025 transitions. Word has length 13 [2020-11-28 03:08:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:33,863 INFO L481 AbstractCegarLoop]: Abstraction has 2614 states and 10025 transitions. [2020-11-28 03:08:33,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:08:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 10025 transitions. [2020-11-28 03:08:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:08:33,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:33,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:33,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:08:33,867 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2067239881, now seen corresponding path program 1 times [2020-11-28 03:08:33,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:33,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944248732] [2020-11-28 03:08:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:34,008 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-28 03:08:34,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944248732] [2020-11-28 03:08:34,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:34,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:08:34,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141313027] [2020-11-28 03:08:34,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:08:34,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:34,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:08:34,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:34,010 INFO L87 Difference]: Start difference. First operand 2614 states and 10025 transitions. Second operand 6 states. [2020-11-28 03:08:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:34,257 INFO L93 Difference]: Finished difference Result 2922 states and 10956 transitions. [2020-11-28 03:08:34,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:08:34,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-28 03:08:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:34,273 INFO L225 Difference]: With dead ends: 2922 [2020-11-28 03:08:34,274 INFO L226 Difference]: Without dead ends: 2614 [2020-11-28 03:08:34,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:08:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2020-11-28 03:08:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2614. [2020-11-28 03:08:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2020-11-28 03:08:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 10005 transitions. [2020-11-28 03:08:34,404 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 10005 transitions. Word has length 14 [2020-11-28 03:08:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:34,405 INFO L481 AbstractCegarLoop]: Abstraction has 2614 states and 10005 transitions. [2020-11-28 03:08:34,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:08:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 10005 transitions. [2020-11-28 03:08:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:08:34,409 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:34,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:34,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:08:34,409 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1225256004, now seen corresponding path program 1 times [2020-11-28 03:08:34,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:34,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142745222] [2020-11-28 03:08:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:34,583 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-28 03:08:34,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142745222] [2020-11-28 03:08:34,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:34,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:08:34,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775266388] [2020-11-28 03:08:34,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:08:34,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:08:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:08:34,585 INFO L87 Difference]: Start difference. First operand 2614 states and 10005 transitions. Second operand 5 states. [2020-11-28 03:08:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:34,759 INFO L93 Difference]: Finished difference Result 3098 states and 11673 transitions. [2020-11-28 03:08:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:08:34,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-28 03:08:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:34,774 INFO L225 Difference]: With dead ends: 3098 [2020-11-28 03:08:34,774 INFO L226 Difference]: Without dead ends: 2738 [2020-11-28 03:08:34,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2020-11-28 03:08:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2726. [2020-11-28 03:08:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2020-11-28 03:08:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 10473 transitions. [2020-11-28 03:08:34,901 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 10473 transitions. Word has length 14 [2020-11-28 03:08:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:34,901 INFO L481 AbstractCegarLoop]: Abstraction has 2726 states and 10473 transitions. [2020-11-28 03:08:34,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:08:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 10473 transitions. [2020-11-28 03:08:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:08:34,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:34,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:34,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:08:34,908 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:34,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:34,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1227101124, now seen corresponding path program 2 times [2020-11-28 03:08:34,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:34,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340869176] [2020-11-28 03:08:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:35,136 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-28 03:08:35,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340869176] [2020-11-28 03:08:35,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:35,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:08:35,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098239981] [2020-11-28 03:08:35,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:08:35,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:08:35,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:35,138 INFO L87 Difference]: Start difference. First operand 2726 states and 10473 transitions. Second operand 6 states. [2020-11-28 03:08:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:35,400 INFO L93 Difference]: Finished difference Result 3222 states and 12117 transitions. [2020-11-28 03:08:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:08:35,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-28 03:08:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:35,421 INFO L225 Difference]: With dead ends: 3222 [2020-11-28 03:08:35,421 INFO L226 Difference]: Without dead ends: 2822 [2020-11-28 03:08:35,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:08:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2020-11-28 03:08:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2750. [2020-11-28 03:08:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2020-11-28 03:08:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 10521 transitions. [2020-11-28 03:08:35,527 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 10521 transitions. Word has length 14 [2020-11-28 03:08:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:35,528 INFO L481 AbstractCegarLoop]: Abstraction has 2750 states and 10521 transitions. [2020-11-28 03:08:35,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:08:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 10521 transitions. [2020-11-28 03:08:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:08:35,534 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:35,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:35,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:08:35,535 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1211490680, now seen corresponding path program 1 times [2020-11-28 03:08:35,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:35,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128273100] [2020-11-28 03:08:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:35,775 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-28 03:08:35,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128273100] [2020-11-28 03:08:35,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:35,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:08:35,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676348475] [2020-11-28 03:08:35,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:08:35,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:35,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:08:35,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:35,776 INFO L87 Difference]: Start difference. First operand 2750 states and 10521 transitions. Second operand 6 states. [2020-11-28 03:08:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:36,086 INFO L93 Difference]: Finished difference Result 3414 states and 12771 transitions. [2020-11-28 03:08:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:08:36,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-28 03:08:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:36,102 INFO L225 Difference]: With dead ends: 3414 [2020-11-28 03:08:36,102 INFO L226 Difference]: Without dead ends: 3022 [2020-11-28 03:08:36,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:08:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-11-28 03:08:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 2886. [2020-11-28 03:08:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2020-11-28 03:08:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 10871 transitions. [2020-11-28 03:08:36,204 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 10871 transitions. Word has length 15 [2020-11-28 03:08:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:36,235 INFO L481 AbstractCegarLoop]: Abstraction has 2886 states and 10871 transitions. [2020-11-28 03:08:36,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:08:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 10871 transitions. [2020-11-28 03:08:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:08:36,240 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:36,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:36,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:08:36,240 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:36,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1891274807, now seen corresponding path program 1 times [2020-11-28 03:08:36,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:36,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847405143] [2020-11-28 03:08:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:36,483 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-28 03:08:36,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847405143] [2020-11-28 03:08:36,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:36,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:08:36,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319280602] [2020-11-28 03:08:36,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:08:36,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:08:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:08:36,485 INFO L87 Difference]: Start difference. First operand 2886 states and 10871 transitions. Second operand 8 states. [2020-11-28 03:08:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:36,780 INFO L93 Difference]: Finished difference Result 3314 states and 12320 transitions. [2020-11-28 03:08:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:08:36,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-28 03:08:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:36,794 INFO L225 Difference]: With dead ends: 3314 [2020-11-28 03:08:36,794 INFO L226 Difference]: Without dead ends: 3122 [2020-11-28 03:08:36,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:08:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2020-11-28 03:08:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2850. [2020-11-28 03:08:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2850 states. [2020-11-28 03:08:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 10708 transitions. [2020-11-28 03:08:36,892 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 10708 transitions. Word has length 16 [2020-11-28 03:08:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:36,893 INFO L481 AbstractCegarLoop]: Abstraction has 2850 states and 10708 transitions. [2020-11-28 03:08:36,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:08:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 10708 transitions. [2020-11-28 03:08:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:08:36,898 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:36,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:36,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:08:36,899 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:36,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1951241207, now seen corresponding path program 2 times [2020-11-28 03:08:36,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:36,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037901546] [2020-11-28 03:08:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:37,203 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-28 03:08:37,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037901546] [2020-11-28 03:08:37,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:37,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:08:37,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922008674] [2020-11-28 03:08:37,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:08:37,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:37,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:08:37,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:08:37,205 INFO L87 Difference]: Start difference. First operand 2850 states and 10708 transitions. Second operand 8 states. [2020-11-28 03:08:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:37,521 INFO L93 Difference]: Finished difference Result 3722 states and 13794 transitions. [2020-11-28 03:08:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:08:37,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-28 03:08:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:37,539 INFO L225 Difference]: With dead ends: 3722 [2020-11-28 03:08:37,539 INFO L226 Difference]: Without dead ends: 3458 [2020-11-28 03:08:37,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:08:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2020-11-28 03:08:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 2798. [2020-11-28 03:08:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2798 states. [2020-11-28 03:08:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 10481 transitions. [2020-11-28 03:08:37,678 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 10481 transitions. Word has length 16 [2020-11-28 03:08:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:37,678 INFO L481 AbstractCegarLoop]: Abstraction has 2798 states and 10481 transitions. [2020-11-28 03:08:37,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:08:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 10481 transitions. [2020-11-28 03:08:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:08:37,683 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:37,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:37,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:08:37,683 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash 648152453, now seen corresponding path program 1 times [2020-11-28 03:08:37,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:37,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604129731] [2020-11-28 03:08:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:37,775 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-28 03:08:37,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604129731] [2020-11-28 03:08:37,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:37,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:08:37,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775573345] [2020-11-28 03:08:37,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:08:37,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:37,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:08:37,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:08:37,777 INFO L87 Difference]: Start difference. First operand 2798 states and 10481 transitions. Second operand 4 states. [2020-11-28 03:08:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:37,835 INFO L93 Difference]: Finished difference Result 2846 states and 9724 transitions. [2020-11-28 03:08:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:08:37,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-28 03:08:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:37,845 INFO L225 Difference]: With dead ends: 2846 [2020-11-28 03:08:37,845 INFO L226 Difference]: Without dead ends: 2186 [2020-11-28 03:08:37,845 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-28 03:08:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2020-11-28 03:08:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2020-11-28 03:08:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2186 states. [2020-11-28 03:08:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 7421 transitions. [2020-11-28 03:08:37,908 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 7421 transitions. Word has length 16 [2020-11-28 03:08:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:37,908 INFO L481 AbstractCegarLoop]: Abstraction has 2186 states and 7421 transitions. [2020-11-28 03:08:37,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:08:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 7421 transitions. [2020-11-28 03:08:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:08:37,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:37,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:37,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:08:37,913 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1352963929, now seen corresponding path program 1 times [2020-11-28 03:08:37,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:37,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55112077] [2020-11-28 03:08:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:38,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-28 03:08:38,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55112077] [2020-11-28 03:08:38,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:38,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:08:38,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140425246] [2020-11-28 03:08:38,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:08:38,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:08:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:08:38,003 INFO L87 Difference]: Start difference. First operand 2186 states and 7421 transitions. Second operand 5 states. [2020-11-28 03:08:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:38,067 INFO L93 Difference]: Finished difference Result 1792 states and 5552 transitions. [2020-11-28 03:08:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:08:38,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-28 03:08:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:38,072 INFO L225 Difference]: With dead ends: 1792 [2020-11-28 03:08:38,072 INFO L226 Difference]: Without dead ends: 1372 [2020-11-28 03:08:38,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-11-28 03:08:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2020-11-28 03:08:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2020-11-28 03:08:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 4165 transitions. [2020-11-28 03:08:38,108 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 4165 transitions. Word has length 17 [2020-11-28 03:08:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:38,108 INFO L481 AbstractCegarLoop]: Abstraction has 1372 states and 4165 transitions. [2020-11-28 03:08:38,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:08:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 4165 transitions. [2020-11-28 03:08:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 03:08:38,112 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:38,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:08:38,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:08:38,112 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:38,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1235949778, now seen corresponding path program 1 times [2020-11-28 03:08:38,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:38,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633316546] [2020-11-28 03:08:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:38,213 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-28 03:08:38,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633316546] [2020-11-28 03:08:38,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:38,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:08:38,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187133865] [2020-11-28 03:08:38,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:08:38,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:38,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:08:38,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:38,215 INFO L87 Difference]: Start difference. First operand 1372 states and 4165 transitions. Second operand 6 states. [2020-11-28 03:08:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:38,430 INFO L93 Difference]: Finished difference Result 2633 states and 7638 transitions. [2020-11-28 03:08:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:08:38,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-28 03:08:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:38,435 INFO L225 Difference]: With dead ends: 2633 [2020-11-28 03:08:38,435 INFO L226 Difference]: Without dead ends: 1492 [2020-11-28 03:08:38,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:08:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2020-11-28 03:08:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1318. [2020-11-28 03:08:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2020-11-28 03:08:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3785 transitions. [2020-11-28 03:08:38,470 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3785 transitions. Word has length 19 [2020-11-28 03:08:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:38,470 INFO L481 AbstractCegarLoop]: Abstraction has 1318 states and 3785 transitions. [2020-11-28 03:08:38,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:08:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3785 transitions. [2020-11-28 03:08:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 03:08:38,474 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:38,474 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] [2020-11-28 03:08:38,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:08:38,474 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash 470011188, now seen corresponding path program 1 times [2020-11-28 03:08:38,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:38,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927010854] [2020-11-28 03:08:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:38,570 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-28 03:08:38,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927010854] [2020-11-28 03:08:38,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:38,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:08:38,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957477137] [2020-11-28 03:08:38,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:08:38,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:08:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:08:38,572 INFO L87 Difference]: Start difference. First operand 1318 states and 3785 transitions. Second operand 6 states. [2020-11-28 03:08:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:38,658 INFO L93 Difference]: Finished difference Result 1096 states and 3092 transitions. [2020-11-28 03:08:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:08:38,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-28 03:08:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:38,661 INFO L225 Difference]: With dead ends: 1096 [2020-11-28 03:08:38,661 INFO L226 Difference]: Without dead ends: 960 [2020-11-28 03:08:38,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:08:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2020-11-28 03:08:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 864. [2020-11-28 03:08:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2020-11-28 03:08:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2465 transitions. [2020-11-28 03:08:38,690 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2465 transitions. Word has length 20 [2020-11-28 03:08:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:38,691 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 2465 transitions. [2020-11-28 03:08:38,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:08:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2465 transitions. [2020-11-28 03:08:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:08:38,695 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:38,695 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, 1] [2020-11-28 03:08:38,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:08:38,696 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:38,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1831088851, now seen corresponding path program 1 times [2020-11-28 03:08:38,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:38,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019020370] [2020-11-28 03:08:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:38,856 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-28 03:08:38,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019020370] [2020-11-28 03:08:38,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:38,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:08:38,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137896064] [2020-11-28 03:08:38,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:08:38,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:08:38,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:08:38,858 INFO L87 Difference]: Start difference. First operand 864 states and 2465 transitions. Second operand 7 states. [2020-11-28 03:08:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:38,955 INFO L93 Difference]: Finished difference Result 818 states and 2372 transitions. [2020-11-28 03:08:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:08:38,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-28 03:08:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:38,957 INFO L225 Difference]: With dead ends: 818 [2020-11-28 03:08:38,957 INFO L226 Difference]: Without dead ends: 502 [2020-11-28 03:08:38,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:08:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-11-28 03:08:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 458. [2020-11-28 03:08:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-28 03:08:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1295 transitions. [2020-11-28 03:08:38,972 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1295 transitions. Word has length 23 [2020-11-28 03:08:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:38,973 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1295 transitions. [2020-11-28 03:08:38,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:08:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1295 transitions. [2020-11-28 03:08:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:08:38,977 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:38,978 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, 1, 1, 1, 1, 1] [2020-11-28 03:08:38,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:08:38,978 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:38,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1944802539, now seen corresponding path program 1 times [2020-11-28 03:08:38,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:38,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090254950] [2020-11-28 03:08:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:39,500 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-28 03:08:39,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090254950] [2020-11-28 03:08:39,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:39,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-28 03:08:39,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11942084] [2020-11-28 03:08:39,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-28 03:08:39,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:39,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 03:08:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:08:39,502 INFO L87 Difference]: Start difference. First operand 458 states and 1295 transitions. Second operand 10 states. [2020-11-28 03:08:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:39,836 INFO L93 Difference]: Finished difference Result 653 states and 1834 transitions. [2020-11-28 03:08:39,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:08:39,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-11-28 03:08:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:39,839 INFO L225 Difference]: With dead ends: 653 [2020-11-28 03:08:39,839 INFO L226 Difference]: Without dead ends: 554 [2020-11-28 03:08:39,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:08:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-11-28 03:08:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 506. [2020-11-28 03:08:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-11-28 03:08:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1435 transitions. [2020-11-28 03:08:39,851 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1435 transitions. Word has length 27 [2020-11-28 03:08:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:39,852 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 1435 transitions. [2020-11-28 03:08:39,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-28 03:08:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1435 transitions. [2020-11-28 03:08:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:08:39,853 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:39,853 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, 1, 1, 1, 1, 1] [2020-11-28 03:08:39,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:08:39,854 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1815600137, now seen corresponding path program 2 times [2020-11-28 03:08:39,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:39,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18304124] [2020-11-28 03:08:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:39,942 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-28 03:08:39,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18304124] [2020-11-28 03:08:39,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:39,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:08:39,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095468410] [2020-11-28 03:08:39,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:08:39,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:08:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:08:39,944 INFO L87 Difference]: Start difference. First operand 506 states and 1435 transitions. Second operand 5 states. [2020-11-28 03:08:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:39,989 INFO L93 Difference]: Finished difference Result 659 states and 1835 transitions. [2020-11-28 03:08:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:08:39,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-11-28 03:08:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:39,990 INFO L225 Difference]: With dead ends: 659 [2020-11-28 03:08:39,991 INFO L226 Difference]: Without dead ends: 404 [2020-11-28 03:08:39,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:08:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-11-28 03:08:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2020-11-28 03:08:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-11-28 03:08:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1104 transitions. [2020-11-28 03:08:40,000 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1104 transitions. Word has length 27 [2020-11-28 03:08:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:40,000 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 1104 transitions. [2020-11-28 03:08:40,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:08:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1104 transitions. [2020-11-28 03:08:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:08:40,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:40,002 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, 1, 1, 1, 1, 1] [2020-11-28 03:08:40,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:08:40,002 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:40,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1372700997, now seen corresponding path program 3 times [2020-11-28 03:08:40,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:40,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544144544] [2020-11-28 03:08:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:40,190 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-28 03:08:40,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544144544] [2020-11-28 03:08:40,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:40,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:08:40,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523116182] [2020-11-28 03:08:40,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:08:40,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:08:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:08:40,192 INFO L87 Difference]: Start difference. First operand 404 states and 1104 transitions. Second operand 8 states. [2020-11-28 03:08:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:40,386 INFO L93 Difference]: Finished difference Result 671 states and 1850 transitions. [2020-11-28 03:08:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:08:40,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-28 03:08:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:40,387 INFO L225 Difference]: With dead ends: 671 [2020-11-28 03:08:40,387 INFO L226 Difference]: Without dead ends: 301 [2020-11-28 03:08:40,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:08:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-11-28 03:08:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2020-11-28 03:08:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-11-28 03:08:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 819 transitions. [2020-11-28 03:08:40,394 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 819 transitions. Word has length 27 [2020-11-28 03:08:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:40,394 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 819 transitions. [2020-11-28 03:08:40,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:08:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 819 transitions. [2020-11-28 03:08:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:08:40,396 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:40,396 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, 1, 1, 1, 1, 1] [2020-11-28 03:08:40,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:08:40,396 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 28795947, now seen corresponding path program 4 times [2020-11-28 03:08:40,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:40,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831797689] [2020-11-28 03:08:40,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:08:40,561 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-28 03:08:40,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831797689] [2020-11-28 03:08:40,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:08:40,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:08:40,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380708764] [2020-11-28 03:08:40,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:08:40,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:08:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:08:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:08:40,562 INFO L87 Difference]: Start difference. First operand 301 states and 819 transitions. Second operand 7 states. [2020-11-28 03:08:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:08:40,640 INFO L93 Difference]: Finished difference Result 403 states and 1080 transitions. [2020-11-28 03:08:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:08:40,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-28 03:08:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:08:40,641 INFO L225 Difference]: With dead ends: 403 [2020-11-28 03:08:40,641 INFO L226 Difference]: Without dead ends: 136 [2020-11-28 03:08:40,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:08:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-28 03:08:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2020-11-28 03:08:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-28 03:08:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 319 transitions. [2020-11-28 03:08:40,645 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 319 transitions. Word has length 27 [2020-11-28 03:08:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:08:40,645 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 319 transitions. [2020-11-28 03:08:40,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:08:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 319 transitions. [2020-11-28 03:08:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:08:40,646 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:08:40,646 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, 1, 1, 1, 1, 1] [2020-11-28 03:08:40,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:08:40,646 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:08:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:08:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash -804012313, now seen corresponding path program 5 times [2020-11-28 03:08:40,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:08:40,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155714125] [2020-11-28 03:08:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:08:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:08:40,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:08:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:08:40,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:08:40,791 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:08:40,791 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:08:40,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 03:08:40,821 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-28 03:08:40,822 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,822 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-28 03:08:40,822 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [782] [2020-11-28 03:08:40,823 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-28 03:08:40,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,823 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-28 03:08:40,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,823 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-28 03:08:40,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,823 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-28 03:08:40,824 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,824 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-28 03:08:40,824 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,827 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-28 03:08:40,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,827 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-28 03:08:40,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,827 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-28 03:08:40,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,828 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-28 03:08:40,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,828 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-28 03:08:40,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,828 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-28 03:08:40,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,829 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-28 03:08:40,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,829 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-28 03:08:40,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,829 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-28 03:08:40,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,830 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-28 03:08:40,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,835 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-28 03:08:40,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,835 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-28 03:08:40,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,836 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-28 03:08:40,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,836 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-28 03:08:40,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,836 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-28 03:08:40,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,837 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-28 03:08:40,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,837 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-28 03:08:40,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,837 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-28 03:08:40,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,838 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-28 03:08:40,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,838 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-28 03:08:40,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,838 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-28 03:08:40,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,838 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-28 03:08:40,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,839 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-28 03:08:40,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,839 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-28 03:08:40,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,839 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-28 03:08:40,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,840 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-28 03:08:40,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,840 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-28 03:08:40,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,840 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-28 03:08:40,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:08:40 BasicIcfg [2020-11-28 03:08:40,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:08:40,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:08:40,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:08:40,941 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:08:40,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:08:22" (3/4) ... [2020-11-28 03:08:40,943 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:08:40,959 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-28 03:08:40,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,959 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-28 03:08:40,959 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [782] [2020-11-28 03:08:40,960 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-28 03:08:40,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,960 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-28 03:08:40,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,960 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-28 03:08:40,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,960 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-28 03:08:40,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,961 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-28 03:08:40,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,961 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-28 03:08:40,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,962 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-28 03:08:40,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,962 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-28 03:08:40,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,962 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-28 03:08:40,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,962 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-28 03:08:40,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,963 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-28 03:08:40,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,963 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-28 03:08:40,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,963 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-28 03:08:40,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,963 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-28 03:08:40,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,964 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-28 03:08:40,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,964 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-28 03:08:40,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,964 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-28 03:08:40,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,965 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-28 03:08:40,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,965 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-28 03:08:40,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,965 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-28 03:08:40,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,965 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-28 03:08:40,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,966 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-28 03:08:40,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,966 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-28 03:08:40,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,966 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-28 03:08:40,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,966 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-28 03:08:40,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,967 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-28 03:08:40,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,967 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-28 03:08:40,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,967 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-28 03:08:40,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,967 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-28 03:08:40,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,968 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-28 03:08:40,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,968 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-28 03:08:40,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,968 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-28 03:08:40,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:40,968 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-28 03:08:40,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:08:41,100 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_65c2b043-948c-4e7f-9672-8a28a1f5f223/bin/uautomizer/witness.graphml [2020-11-28 03:08:41,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:08:41,102 INFO L168 Benchmark]: Toolchain (without parser) took 22150.38 ms. Allocated memory was 107.0 MB in the beginning and 610.3 MB in the end (delta: 503.3 MB). Free memory was 73.9 MB in the beginning and 524.4 MB in the end (delta: -450.5 MB). Peak memory consumption was 411.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:08:41,102 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 77.6 MB. Free memory was 36.0 MB in the beginning and 36.0 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:08:41,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.42 ms. Allocated memory is still 107.0 MB. Free memory was 73.7 MB in the beginning and 57.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:08:41,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.00 ms. Allocated memory is still 107.0 MB. Free memory was 57.9 MB in the beginning and 55.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:08:41,103 INFO L168 Benchmark]: Boogie Preprocessor took 40.67 ms. Allocated memory is still 107.0 MB. Free memory was 55.3 MB in the beginning and 52.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:08:41,104 INFO L168 Benchmark]: RCFGBuilder took 2598.51 ms. Allocated memory was 107.0 MB in the beginning and 148.9 MB in the end (delta: 41.9 MB). Free memory was 52.6 MB in the beginning and 114.7 MB in the end (delta: -62.1 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:08:41,104 INFO L168 Benchmark]: TraceAbstraction took 18556.36 ms. Allocated memory was 148.9 MB in the beginning and 610.3 MB in the end (delta: 461.4 MB). Free memory was 114.7 MB in the beginning and 185.3 MB in the end (delta: -70.6 MB). Peak memory consumption was 390.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:08:41,105 INFO L168 Benchmark]: Witness Printer took 159.82 ms. Allocated memory is still 610.3 MB. Free memory was 185.3 MB in the beginning and 524.4 MB in the end (delta: -339.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:08:41,107 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.29 ms. Allocated memory is still 77.6 MB. Free memory was 36.0 MB in the beginning and 36.0 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 712.42 ms. Allocated memory is still 107.0 MB. Free memory was 73.7 MB in the beginning and 57.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.00 ms. Allocated memory is still 107.0 MB. Free memory was 57.9 MB in the beginning and 55.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.67 ms. Allocated memory is still 107.0 MB. Free memory was 55.3 MB in the beginning and 52.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2598.51 ms. Allocated memory was 107.0 MB in the beginning and 148.9 MB in the end (delta: 41.9 MB). Free memory was 52.6 MB in the beginning and 114.7 MB in the end (delta: -62.1 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18556.36 ms. Allocated memory was 148.9 MB in the beginning and 610.3 MB in the end (delta: 461.4 MB). Free memory was 114.7 MB in the beginning and 185.3 MB in the end (delta: -70.6 MB). Peak memory consumption was 390.9 MB. Max. memory is 16.1 GB. * Witness Printer took 159.82 ms. Allocated memory is still 610.3 MB. Free memory was 185.3 MB in the beginning and 524.4 MB in the end (delta: -339.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1820 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 188 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.8s, 128 PlacesBefore, 46 PlacesAfterwards, 118 TransitionsBefore, 34 TransitionsAfterwards, 2754 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 7788 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix053_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L748] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix053_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 863 SDtfs, 1091 SDslu, 2234 SDs, 0 SdLazy, 981 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1546 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 63599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...