./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt.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_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/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 b1b5164f8a126d51217b39440a6fa1eab85710fb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:17:02,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:17:02,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:17:02,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:17:02,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:17:02,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:17:02,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:17:02,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:17:02,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:17:02,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:17:02,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:17:02,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:17:02,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:17:02,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:17:02,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:17:02,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:17:02,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:17:02,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:17:02,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:17:02,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:17:02,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:17:02,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:17:02,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:17:02,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:17:02,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:17:02,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:17:02,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:17:02,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:17:02,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:17:02,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:17:02,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:17:02,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:17:02,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:17:02,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:17:02,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:17:02,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:17:02,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:17:02,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:17:02,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:17:02,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:17:02,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:17:02,704 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:17:02,745 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:17:02,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:17:02,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:17:02,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:17:02,747 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:17:02,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:17:02,747 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:17:02,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:17:02,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:17:02,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:17:02,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:17:02,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:17:02,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:17:02,750 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:17:02,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:17:02,750 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:17:02,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:17:02,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:17:02,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:17:02,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:17:02,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:17:02,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:17:02,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:17:02,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:17:02,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:17:02,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:17:02,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:17:02,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:17:02,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:17:02,753 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_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/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_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/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 -> b1b5164f8a126d51217b39440a6fa1eab85710fb [2020-11-28 03:17:03,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:17:03,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:17:03,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:17:03,051 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:17:03,056 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:17:03,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix023_power.opt.i [2020-11-28 03:17:03,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/data/63748936e/08445d2a8ca14a2c86f55b29305304aa/FLAG1a06af60a [2020-11-28 03:17:03,791 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:17:03,792 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/sv-benchmarks/c/pthread-wmm/mix023_power.opt.i [2020-11-28 03:17:03,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/data/63748936e/08445d2a8ca14a2c86f55b29305304aa/FLAG1a06af60a [2020-11-28 03:17:04,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/data/63748936e/08445d2a8ca14a2c86f55b29305304aa [2020-11-28 03:17:04,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:17:04,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:17:04,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:17:04,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:17:04,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:17:04,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1d551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04, skipping insertion in model container [2020-11-28 03:17:04,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:17:04,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:17:04,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:17:04,617 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:17:04,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:17:04,797 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:17:04,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04 WrapperNode [2020-11-28 03:17:04,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:17:04,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:17:04,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:17:04,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:17:04,806 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:17:04" (1/1) ... [2020-11-28 03:17:04,841 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:17:04" (1/1) ... [2020-11-28 03:17:04,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:17:04,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:17:04,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:17:04,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:17:04,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... [2020-11-28 03:17:04,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:17:04,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:17:04,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:17:04,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:17:04,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/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:17:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:17:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:17:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:17:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:17:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:17:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:17:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:17:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:17:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:17:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:17:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 03:17:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 03:17:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:17:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:17:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:17:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:17:05,049 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:17:07,527 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:17:07,527 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:17:07,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:07 BoogieIcfgContainer [2020-11-28 03:17:07,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:17:07,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:17:07,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:17:07,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:17:07,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:17:04" (1/3) ... [2020-11-28 03:17:07,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be734ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:07, skipping insertion in model container [2020-11-28 03:17:07,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:04" (2/3) ... [2020-11-28 03:17:07,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be734ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:07, skipping insertion in model container [2020-11-28 03:17:07,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:07" (3/3) ... [2020-11-28 03:17:07,537 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2020-11-28 03:17:07,548 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:17:07,548 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:17:07,551 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:17:07,552 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:17:07,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,588 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,588 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,600 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,603 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,603 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,607 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,608 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,615 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,617 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,621 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,622 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,622 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:17:07,625 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:17:07,636 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 03:17:07,655 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:17:07,655 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:17:07,656 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:17:07,656 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:17:07,656 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:17:07,656 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:17:07,656 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:17:07,656 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:17:07,668 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:17:07,670 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-28 03:17:07,673 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-28 03:17:07,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-28 03:17:07,722 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-28 03:17:07,722 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:17:07,727 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-28 03:17:07,737 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-11-28 03:17:07,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:07,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:07,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:07,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:07,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:07,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:07,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:07,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:07,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:07,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:07,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:07,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:07,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:07,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:08,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:08,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:17:08,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:17:08,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:08,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:08,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:08,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:08,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:17:08,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:08,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:08,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:08,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:08,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:08,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:08,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:17:08,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:17:08,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:08,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:08,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:08,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:08,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:08,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:08,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:08,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:08,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:08,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:08,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:08,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:08,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:08,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:08,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:09,370 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 03:17:09,505 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 03:17:09,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:09,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:09,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:09,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:09,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:09,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:09,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:09,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:09,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:09,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:09,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:09,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:09,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:09,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:09,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:09,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:09,882 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-28 03:17:10,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:17:10,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:10,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:10,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:10,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:10,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:10,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:10,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:10,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:10,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:10,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:10,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:10,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:10,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:10,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:10,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:10,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:10,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:10,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:10,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:17:10,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:17:10,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:10,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:10,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:10,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:10,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:10,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:10,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:10,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:10,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:10,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:10,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:10,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:10,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:10,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:10,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:11,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:17:11,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:17:11,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:11,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:11,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:11,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:11,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:11,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:11,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:17:11,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:17:11,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:11,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:11,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:11,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:11,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:11,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:11,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:11,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:11,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:11,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:11,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:11,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:11,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:11,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:11,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:11,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:11,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:11,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:11,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:11,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:11,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:17:11,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:17:11,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:12,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:12,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:17:12,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:17:12,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:12,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:12,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:12,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:12,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:12,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:12,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:12,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:17:12,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:17:12,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:17:12,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:12,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:12,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:12,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:17:12,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:12,818 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-11-28 03:17:13,106 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-28 03:17:13,237 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-11-28 03:17:13,391 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-28 03:17:13,505 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-28 03:17:13,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:13,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:13,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:13,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:13,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:13,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:13,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:13,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:17:13,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:13,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:13,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:13,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:17:13,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:17:13,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:13,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:17:13,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:17:14,227 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-28 03:17:14,479 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-28 03:17:14,960 INFO L131 LiptonReduction]: Checked pairs total: 7701 [2020-11-28 03:17:14,960 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-11-28 03:17:14,965 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-11-28 03:17:15,262 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-28 03:17:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-28 03:17:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 03:17:15,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:15,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:17:15,273 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:17:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1877032046, now seen corresponding path program 1 times [2020-11-28 03:17:15,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:15,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127550103] [2020-11-28 03:17:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:15,616 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:17:15,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127550103] [2020-11-28 03:17:15,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:15,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:17:15,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166366212] [2020-11-28 03:17:15,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:15,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:15,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:15,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:15,642 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-28 03:17:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:15,767 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-28 03:17:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:15,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 03:17:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:15,812 INFO L225 Difference]: With dead ends: 3250 [2020-11-28 03:17:15,812 INFO L226 Difference]: Without dead ends: 2650 [2020-11-28 03:17:15,813 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:17:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-11-28 03:17:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-11-28 03:17:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-11-28 03:17:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-11-28 03:17:16,085 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-11-28 03:17:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:16,086 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-11-28 03:17:16,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-11-28 03:17:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:17:16,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:16,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:17:16,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:17:16,090 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:17:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 394130702, now seen corresponding path program 1 times [2020-11-28 03:17:16,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:16,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927767154] [2020-11-28 03:17:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:16,169 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:17:16,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927767154] [2020-11-28 03:17:16,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:16,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:17:16,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421460327] [2020-11-28 03:17:16,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:16,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:16,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:16,172 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-11-28 03:17:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:16,225 INFO L93 Difference]: Finished difference Result 2590 states and 9950 transitions. [2020-11-28 03:17:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:16,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 03:17:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:16,254 INFO L225 Difference]: With dead ends: 2590 [2020-11-28 03:17:16,256 INFO L226 Difference]: Without dead ends: 2590 [2020-11-28 03:17:16,256 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:17:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2020-11-28 03:17:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2020-11-28 03:17:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2020-11-28 03:17:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 9950 transitions. [2020-11-28 03:17:16,401 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 9950 transitions. Word has length 11 [2020-11-28 03:17:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:16,401 INFO L481 AbstractCegarLoop]: Abstraction has 2590 states and 9950 transitions. [2020-11-28 03:17:16,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 9950 transitions. [2020-11-28 03:17:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:17:16,409 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:16,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:17:16,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:17:16,410 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:17:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash -858357833, now seen corresponding path program 1 times [2020-11-28 03:17:16,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:16,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264161069] [2020-11-28 03:17:16,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:16,505 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:17:16,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264161069] [2020-11-28 03:17:16,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:16,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:17:16,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451262228] [2020-11-28 03:17:16,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:16,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:16,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:16,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:16,507 INFO L87 Difference]: Start difference. First operand 2590 states and 9950 transitions. Second operand 3 states. [2020-11-28 03:17:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:16,545 INFO L93 Difference]: Finished difference Result 2554 states and 9788 transitions. [2020-11-28 03:17:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:16,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-28 03:17:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:16,572 INFO L225 Difference]: With dead ends: 2554 [2020-11-28 03:17:16,572 INFO L226 Difference]: Without dead ends: 2554 [2020-11-28 03:17:16,572 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:17:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2020-11-28 03:17:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2020-11-28 03:17:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2020-11-28 03:17:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 9788 transitions. [2020-11-28 03:17:16,678 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 9788 transitions. Word has length 12 [2020-11-28 03:17:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:16,679 INFO L481 AbstractCegarLoop]: Abstraction has 2554 states and 9788 transitions. [2020-11-28 03:17:16,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 9788 transitions. [2020-11-28 03:17:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:17:16,682 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:16,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:17:16,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:17:16,682 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:17:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash -840706110, now seen corresponding path program 1 times [2020-11-28 03:17:16,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:16,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887635556] [2020-11-28 03:17:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:16,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:17:16,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887635556] [2020-11-28 03:17:16,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:16,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:17:16,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430521991] [2020-11-28 03:17:16,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:16,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:16,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:16,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:16,777 INFO L87 Difference]: Start difference. First operand 2554 states and 9788 transitions. Second operand 3 states. [2020-11-28 03:17:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:16,826 INFO L93 Difference]: Finished difference Result 2410 states and 9176 transitions. [2020-11-28 03:17:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:16,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-28 03:17:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:16,850 INFO L225 Difference]: With dead ends: 2410 [2020-11-28 03:17:16,851 INFO L226 Difference]: Without dead ends: 2410 [2020-11-28 03:17:16,851 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:17:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-11-28 03:17:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-11-28 03:17:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-11-28 03:17:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions. [2020-11-28 03:17:17,008 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 13 [2020-11-28 03:17:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:17,008 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions. [2020-11-28 03:17:17,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions. [2020-11-28 03:17:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:17:17,011 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:17,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:17:17,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:17:17,012 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:17:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash -292087857, now seen corresponding path program 1 times [2020-11-28 03:17:17,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:17,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053380494] [2020-11-28 03:17:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:17,079 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:17:17,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053380494] [2020-11-28 03:17:17,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:17,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:17:17,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424716634] [2020-11-28 03:17:17,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:17,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:17,081 INFO L87 Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 3 states. [2020-11-28 03:17:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:17,113 INFO L93 Difference]: Finished difference Result 2290 states and 8670 transitions. [2020-11-28 03:17:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:17,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-28 03:17:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:17,157 INFO L225 Difference]: With dead ends: 2290 [2020-11-28 03:17:17,158 INFO L226 Difference]: Without dead ends: 2290 [2020-11-28 03:17:17,158 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:17:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2020-11-28 03:17:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2020-11-28 03:17:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2020-11-28 03:17:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8670 transitions. [2020-11-28 03:17:17,243 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8670 transitions. Word has length 14 [2020-11-28 03:17:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:17,243 INFO L481 AbstractCegarLoop]: Abstraction has 2290 states and 8670 transitions. [2020-11-28 03:17:17,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8670 transitions. [2020-11-28 03:17:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:17:17,247 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:17,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:17:17,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:17:17,247 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:17:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2122603733, now seen corresponding path program 1 times [2020-11-28 03:17:17,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:17,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634807786] [2020-11-28 03:17:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:17,352 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:17:17,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634807786] [2020-11-28 03:17:17,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:17,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:17,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388695178] [2020-11-28 03:17:17,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:17,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:17,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:17,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:17,354 INFO L87 Difference]: Start difference. First operand 2290 states and 8670 transitions. Second operand 4 states. [2020-11-28 03:17:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:17,436 INFO L93 Difference]: Finished difference Result 2338 states and 8060 transitions. [2020-11-28 03:17:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:17:17,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-28 03:17:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:17,445 INFO L225 Difference]: With dead ends: 2338 [2020-11-28 03:17:17,445 INFO L226 Difference]: Without dead ends: 1738 [2020-11-28 03:17:17,445 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:17:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-11-28 03:17:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2020-11-28 03:17:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2020-11-28 03:17:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 5910 transitions. [2020-11-28 03:17:17,509 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 5910 transitions. Word has length 15 [2020-11-28 03:17:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:17,509 INFO L481 AbstractCegarLoop]: Abstraction has 1738 states and 5910 transitions. [2020-11-28 03:17:17,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 5910 transitions. [2020-11-28 03:17:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:17:17,513 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:17,513 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:17:17,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:17:17,513 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:17:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash 964996659, now seen corresponding path program 1 times [2020-11-28 03:17:17,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:17,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790609304] [2020-11-28 03:17:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:17,664 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:17:17,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790609304] [2020-11-28 03:17:17,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:17,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:17:17,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959314312] [2020-11-28 03:17:17,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:17:17,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:17:17,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:17,666 INFO L87 Difference]: Start difference. First operand 1738 states and 5910 transitions. Second operand 5 states. [2020-11-28 03:17:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:17,746 INFO L93 Difference]: Finished difference Result 1500 states and 4716 transitions. [2020-11-28 03:17:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:17:17,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-28 03:17:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:17,751 INFO L225 Difference]: With dead ends: 1500 [2020-11-28 03:17:17,751 INFO L226 Difference]: Without dead ends: 1140 [2020-11-28 03:17:17,752 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:17:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2020-11-28 03:17:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2020-11-28 03:17:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2020-11-28 03:17:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 3518 transitions. [2020-11-28 03:17:17,789 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 3518 transitions. Word has length 17 [2020-11-28 03:17:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:17,790 INFO L481 AbstractCegarLoop]: Abstraction has 1140 states and 3518 transitions. [2020-11-28 03:17:17,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:17:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 3518 transitions. [2020-11-28 03:17:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 03:17:17,793 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:17,793 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:17:17,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:17:17,794 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:17:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash -200781553, now seen corresponding path program 1 times [2020-11-28 03:17:17,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:17,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272682809] [2020-11-28 03:17:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:17,933 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:17:17,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272682809] [2020-11-28 03:17:17,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:17,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:17:17,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78445633] [2020-11-28 03:17:17,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:17:17,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:17:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:17:17,935 INFO L87 Difference]: Start difference. First operand 1140 states and 3518 transitions. Second operand 6 states. [2020-11-28 03:17:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:18,019 INFO L93 Difference]: Finished difference Result 1009 states and 3090 transitions. [2020-11-28 03:17:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:17:18,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-28 03:17:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:18,025 INFO L225 Difference]: With dead ends: 1009 [2020-11-28 03:17:18,025 INFO L226 Difference]: Without dead ends: 897 [2020-11-28 03:17:18,026 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:17:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2020-11-28 03:17:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2020-11-28 03:17:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2020-11-28 03:17:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2789 transitions. [2020-11-28 03:17:18,056 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2789 transitions. Word has length 20 [2020-11-28 03:17:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:18,056 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 2789 transitions. [2020-11-28 03:17:18,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:17:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2789 transitions. [2020-11-28 03:17:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:17:18,062 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:18,062 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:17:18,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:17:18,063 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:17:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2072426737, now seen corresponding path program 1 times [2020-11-28 03:17:18,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:18,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163382882] [2020-11-28 03:17:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:18,158 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:17:18,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163382882] [2020-11-28 03:17:18,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:18,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:18,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530812265] [2020-11-28 03:17:18,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:18,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:18,160 INFO L87 Difference]: Start difference. First operand 897 states and 2789 transitions. Second operand 4 states. [2020-11-28 03:17:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:18,191 INFO L93 Difference]: Finished difference Result 1151 states and 3501 transitions. [2020-11-28 03:17:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:17:18,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-28 03:17:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:18,195 INFO L225 Difference]: With dead ends: 1151 [2020-11-28 03:17:18,195 INFO L226 Difference]: Without dead ends: 900 [2020-11-28 03:17:18,195 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:17:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-11-28 03:17:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 897. [2020-11-28 03:17:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2020-11-28 03:17:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2712 transitions. [2020-11-28 03:17:18,231 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2712 transitions. Word has length 23 [2020-11-28 03:17:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:18,233 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 2712 transitions. [2020-11-28 03:17:18,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2712 transitions. [2020-11-28 03:17:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:17:18,236 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:18,236 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:17:18,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:17:18,237 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:17:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1622518969, now seen corresponding path program 2 times [2020-11-28 03:17:18,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:18,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195094292] [2020-11-28 03:17:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:18,293 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:17:18,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195094292] [2020-11-28 03:17:18,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:18,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:17:18,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256994233] [2020-11-28 03:17:18,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:18,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:18,295 INFO L87 Difference]: Start difference. First operand 897 states and 2712 transitions. Second operand 3 states. [2020-11-28 03:17:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:18,320 INFO L93 Difference]: Finished difference Result 1263 states and 3697 transitions. [2020-11-28 03:17:18,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:18,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-28 03:17:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:18,324 INFO L225 Difference]: With dead ends: 1263 [2020-11-28 03:17:18,324 INFO L226 Difference]: Without dead ends: 791 [2020-11-28 03:17:18,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2020-11-28 03:17:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2020-11-28 03:17:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-11-28 03:17:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2158 transitions. [2020-11-28 03:17:18,360 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2158 transitions. Word has length 23 [2020-11-28 03:17:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:18,360 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 2158 transitions. [2020-11-28 03:17:18,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2158 transitions. [2020-11-28 03:17:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:17:18,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:18,363 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:17:18,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:17:18,364 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:17:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -930263489, now seen corresponding path program 3 times [2020-11-28 03:17:18,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:18,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183796660] [2020-11-28 03:17:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:18,523 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:17:18,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183796660] [2020-11-28 03:17:18,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:18,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:17:18,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194026495] [2020-11-28 03:17:18,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:17:18,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:17:18,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:17:18,525 INFO L87 Difference]: Start difference. First operand 789 states and 2158 transitions. Second operand 7 states. [2020-11-28 03:17:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:18,619 INFO L93 Difference]: Finished difference Result 762 states and 2104 transitions. [2020-11-28 03:17:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:17:18,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-28 03:17:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:18,620 INFO L225 Difference]: With dead ends: 762 [2020-11-28 03:17:18,620 INFO L226 Difference]: Without dead ends: 214 [2020-11-28 03:17:18,621 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:17:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-11-28 03:17:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-11-28 03:17:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-11-28 03:17:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-11-28 03:17:18,627 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 23 [2020-11-28 03:17:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:18,627 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-11-28 03:17:18,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:17:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-11-28 03:17:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:17:18,629 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:18,629 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:17:18,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:17:18,629 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:17:18,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1331134533, now seen corresponding path program 1 times [2020-11-28 03:17:18,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:18,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344853533] [2020-11-28 03:17:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:18,706 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:17:18,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344853533] [2020-11-28 03:17:18,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:18,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:17:18,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267054410] [2020-11-28 03:17:18,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:18,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:18,708 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 3 states. [2020-11-28 03:17:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:18,721 INFO L93 Difference]: Finished difference Result 330 states and 834 transitions. [2020-11-28 03:17:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:18,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-11-28 03:17:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:18,722 INFO L225 Difference]: With dead ends: 330 [2020-11-28 03:17:18,723 INFO L226 Difference]: Without dead ends: 138 [2020-11-28 03:17:18,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-28 03:17:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-11-28 03:17:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-11-28 03:17:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions. [2020-11-28 03:17:18,727 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 27 [2020-11-28 03:17:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:18,727 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 323 transitions. [2020-11-28 03:17:18,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions. [2020-11-28 03:17:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:17:18,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:18,730 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:17:18,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:17:18,730 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:17:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2136042089, now seen corresponding path program 2 times [2020-11-28 03:17:18,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:18,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626147425] [2020-11-28 03:17:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:18,933 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:17:18,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626147425] [2020-11-28 03:17:18,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:18,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:17:18,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211345760] [2020-11-28 03:17:18,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:17:18,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:17:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:17:18,935 INFO L87 Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 7 states. [2020-11-28 03:17:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:19,088 INFO L93 Difference]: Finished difference Result 164 states and 377 transitions. [2020-11-28 03:17:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:17:19,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-28 03:17:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:19,089 INFO L225 Difference]: With dead ends: 164 [2020-11-28 03:17:19,090 INFO L226 Difference]: Without dead ends: 80 [2020-11-28 03:17:19,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:17:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-28 03:17:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-11-28 03:17:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-28 03:17:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 157 transitions. [2020-11-28 03:17:19,093 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 157 transitions. Word has length 27 [2020-11-28 03:17:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:19,093 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 157 transitions. [2020-11-28 03:17:19,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:17:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 157 transitions. [2020-11-28 03:17:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:17:19,093 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:19,094 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:17:19,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:17:19,094 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:17:19,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash -865695065, now seen corresponding path program 3 times [2020-11-28 03:17:19,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:19,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531362674] [2020-11-28 03:17:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:17:19,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:17:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:17:19,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:17:19,350 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:17:19,351 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:17:19,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:17:19,352 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 03:17:19,384 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L3-->L877: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-1612750507 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1612750507 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1612750507 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1612750507 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1612750507 0)) (or (and (= ~y$w_buff1_used~0_Out-1612750507 ~y$w_buff1_used~0_In-1612750507) .cse0) (and .cse1 (= ~y$w_buff1_used~0_Out-1612750507 0) .cse2)) (= ~y$r_buff0_thd0~0_Out-1612750507 ~y$r_buff0_thd0~0_In-1612750507) (= ~y$r_buff1_thd0~0_In-1612750507 ~y$r_buff1_thd0~0_Out-1612750507) (or (and .cse3 (= ~y$w_buff0~0_In-1612750507 ~y~0_Out-1612750507) .cse4) (and .cse5 (or (and .cse1 (= ~y$w_buff1~0_In-1612750507 ~y~0_Out-1612750507) .cse2) (and (= ~y~0_In-1612750507 ~y~0_Out-1612750507) .cse0)))) (or (and (= ~y$w_buff0_used~0_In-1612750507 ~y$w_buff0_used~0_Out-1612750507) .cse5) (and .cse3 (= ~y$w_buff0_used~0_Out-1612750507 0) .cse4))))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1612750507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612750507, ~y$w_buff1~0=~y$w_buff1~0_In-1612750507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1612750507, ~y$w_buff0~0=~y$w_buff0~0_In-1612750507, ~y~0=~y~0_In-1612750507, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1612750507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1612750507} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1612750507, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1612750507|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1612750507|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1612750507|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1612750507|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1612750507|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1612750507|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1612750507, ~y$w_buff1~0=~y$w_buff1~0_In-1612750507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1612750507, ~y$w_buff0~0=~y$w_buff0~0_In-1612750507, ~y~0=~y~0_Out-1612750507, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1612750507, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1612750507} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 03:17:19,393 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:17:19,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,394 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:17:19,394 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-11-28 03:17:19,396 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:17:19,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,396 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:17:19,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,397 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:17:19,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,397 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:17:19,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,398 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:17:19,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,399 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:17:19,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,399 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:17:19,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,400 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:17:19,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,400 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:17:19,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,400 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:17:19,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,401 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:17:19,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,401 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:17:19,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,402 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:17:19,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,406 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:17:19,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,407 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:17:19,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,407 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:17:19,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,408 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:17:19,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,408 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:17:19,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,409 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:17:19,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,409 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:17:19,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,410 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:17:19,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,410 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:17:19,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,410 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:17:19,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:17:19 BasicIcfg [2020-11-28 03:17:19,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:17:19,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:17:19,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:17:19,517 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:17:19,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:07" (3/4) ... [2020-11-28 03:17:19,520 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:17:19,545 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L3-->L877: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-1612750507 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1612750507 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1612750507 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1612750507 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1612750507 0)) (or (and (= ~y$w_buff1_used~0_Out-1612750507 ~y$w_buff1_used~0_In-1612750507) .cse0) (and .cse1 (= ~y$w_buff1_used~0_Out-1612750507 0) .cse2)) (= ~y$r_buff0_thd0~0_Out-1612750507 ~y$r_buff0_thd0~0_In-1612750507) (= ~y$r_buff1_thd0~0_In-1612750507 ~y$r_buff1_thd0~0_Out-1612750507) (or (and .cse3 (= ~y$w_buff0~0_In-1612750507 ~y~0_Out-1612750507) .cse4) (and .cse5 (or (and .cse1 (= ~y$w_buff1~0_In-1612750507 ~y~0_Out-1612750507) .cse2) (and (= ~y~0_In-1612750507 ~y~0_Out-1612750507) .cse0)))) (or (and (= ~y$w_buff0_used~0_In-1612750507 ~y$w_buff0_used~0_Out-1612750507) .cse5) (and .cse3 (= ~y$w_buff0_used~0_Out-1612750507 0) .cse4))))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1612750507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612750507, ~y$w_buff1~0=~y$w_buff1~0_In-1612750507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1612750507, ~y$w_buff0~0=~y$w_buff0~0_In-1612750507, ~y~0=~y~0_In-1612750507, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1612750507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1612750507} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1612750507, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1612750507|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1612750507|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1612750507|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1612750507|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1612750507|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1612750507|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1612750507, ~y$w_buff1~0=~y$w_buff1~0_In-1612750507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1612750507, ~y$w_buff0~0=~y$w_buff0~0_In-1612750507, ~y~0=~y~0_Out-1612750507, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1612750507, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1612750507} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 03:17:19,548 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:17:19,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,548 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:17:19,548 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-11-28 03:17:19,549 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:17:19,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,549 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:17:19,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,549 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:17:19,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,550 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:17:19,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,550 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:17:19,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,550 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:17:19,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,551 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:17:19,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,551 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:17:19,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,551 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:17:19,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,552 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:17:19,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,552 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:17:19,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,552 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:17:19,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,553 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:17:19,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,553 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:17:19,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,553 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:17:19,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,554 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:17:19,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,554 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:17:19,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,554 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:17:19,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,555 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:17:19,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,555 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:17:19,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,555 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:17:19,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,555 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:17:19,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,556 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:17:19,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:17:19,677 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_037ddd9c-7d20-4887-bcd4-a2c3bdd9ae1f/bin/uautomizer/witness.graphml [2020-11-28 03:17:19,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:17:19,679 INFO L168 Benchmark]: Toolchain (without parser) took 15616.67 ms. Allocated memory was 113.2 MB in the beginning and 408.9 MB in the end (delta: 295.7 MB). Free memory was 79.8 MB in the beginning and 310.9 MB in the end (delta: -231.1 MB). Peak memory consumption was 63.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:19,679 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 81.8 MB. Free memory was 52.9 MB in the beginning and 52.8 MB in the end (delta: 29.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:17:19,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.62 ms. Allocated memory is still 113.2 MB. Free memory was 79.8 MB in the beginning and 64.8 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:19,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.74 ms. Allocated memory is still 113.2 MB. Free memory was 64.8 MB in the beginning and 62.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:19,680 INFO L168 Benchmark]: Boogie Preprocessor took 72.11 ms. Allocated memory is still 113.2 MB. Free memory was 62.6 MB in the beginning and 60.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:19,681 INFO L168 Benchmark]: RCFGBuilder took 2556.41 ms. Allocated memory was 113.2 MB in the beginning and 138.4 MB in the end (delta: 25.2 MB). Free memory was 60.3 MB in the beginning and 92.0 MB in the end (delta: -31.7 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:19,681 INFO L168 Benchmark]: TraceAbstraction took 11985.67 ms. Allocated memory was 138.4 MB in the beginning and 408.9 MB in the end (delta: 270.5 MB). Free memory was 92.0 MB in the beginning and 336.1 MB in the end (delta: -244.1 MB). Peak memory consumption was 157.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:19,682 INFO L168 Benchmark]: Witness Printer took 160.75 ms. Allocated memory is still 408.9 MB. Free memory was 336.1 MB in the beginning and 310.9 MB in the end (delta: 25.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:19,684 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.21 ms. Allocated memory is still 81.8 MB. Free memory was 52.9 MB in the beginning and 52.8 MB in the end (delta: 29.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 734.62 ms. Allocated memory is still 113.2 MB. Free memory was 79.8 MB in the beginning and 64.8 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 100.74 ms. Allocated memory is still 113.2 MB. Free memory was 64.8 MB in the beginning and 62.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.11 ms. Allocated memory is still 113.2 MB. Free memory was 62.6 MB in the beginning and 60.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2556.41 ms. Allocated memory was 113.2 MB in the beginning and 138.4 MB in the end (delta: 25.2 MB). Free memory was 60.3 MB in the beginning and 92.0 MB in the end (delta: -31.7 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11985.67 ms. Allocated memory was 138.4 MB in the beginning and 408.9 MB in the end (delta: 270.5 MB). Free memory was 92.0 MB in the beginning and 336.1 MB in the end (delta: -244.1 MB). Peak memory consumption was 157.7 MB. Max. memory is 16.1 GB. * Witness Printer took 160.75 ms. Allocated memory is still 408.9 MB. Free memory was 336.1 MB in the beginning and 310.9 MB in the end (delta: 25.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1898 VarBasedMoverChecksPositive, 116 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 96 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 224 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.2s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 7701 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L865] 0 pthread_t t608; [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix023_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L837] 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) [L837] 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) [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 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 [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L841] 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 [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L755] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1 [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L782] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L814] 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) [L814] 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) [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 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 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 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 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix023_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=49, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 448 SDtfs, 412 SDslu, 634 SDs, 0 SdLazy, 217 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s 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: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 15391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...