./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_tso.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_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/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 aa4f12e12406c1b1fbaf73a04167fb0ae592c2b7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 23:33:07,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:33:07,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:33:07,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:33:07,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:33:07,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:33:07,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:33:07,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:33:07,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:33:07,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:33:07,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:33:07,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:33:07,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:33:07,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:33:07,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:33:07,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:33:07,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:33:07,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:33:07,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:33:07,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:33:07,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:33:07,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:33:07,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:33:07,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:33:07,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:33:07,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:33:07,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:33:07,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:33:07,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:33:07,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:33:07,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:33:07,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:33:07,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:33:07,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:33:07,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:33:07,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:33:07,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:33:07,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:33:07,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:33:07,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:33:07,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:33:07,571 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 23:33:07,594 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:33:07,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:33:07,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:33:07,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:33:07,596 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:33:07,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:33:07,597 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:33:07,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:33:07,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:33:07,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:33:07,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 23:33:07,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:33:07,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 23:33:07,599 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:33:07,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:33:07,600 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:33:07,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 23:33:07,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:33:07,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:33:07,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:33:07,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:33:07,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:33:07,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:33:07,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:33:07,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 23:33:07,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:33:07,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 23:33:07,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 23:33:07,604 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:33:07,604 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_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/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_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/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 -> aa4f12e12406c1b1fbaf73a04167fb0ae592c2b7 [2020-11-29 23:33:07,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:33:07,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:33:07,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:33:07,875 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:33:07,876 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:33:07,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix027_tso.opt.i [2020-11-29 23:33:07,944 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/data/6721c8fe9/f96084ddb52b4a6584c00d8d8af704bc/FLAGe13e62a22 [2020-11-29 23:33:08,483 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:33:08,485 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/sv-benchmarks/c/pthread-wmm/mix027_tso.opt.i [2020-11-29 23:33:08,504 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/data/6721c8fe9/f96084ddb52b4a6584c00d8d8af704bc/FLAGe13e62a22 [2020-11-29 23:33:08,781 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/data/6721c8fe9/f96084ddb52b4a6584c00d8d8af704bc [2020-11-29 23:33:08,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:33:08,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:33:08,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:33:08,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:33:08,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:33:08,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:33:08" (1/1) ... [2020-11-29 23:33:08,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd7e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:08, skipping insertion in model container [2020-11-29 23:33:08,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:33:08" (1/1) ... [2020-11-29 23:33:08,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:33:08,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:33:09,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:33:09,438 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:33:09,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:33:09,633 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:33:09,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09 WrapperNode [2020-11-29 23:33:09,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:33:09,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:33:09,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:33:09,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:33:09,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:33:09,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:33:09,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:33:09,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:33:09,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... [2020-11-29 23:33:09,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:33:09,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:33:09,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:33:09,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:33:09,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/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-29 23:33:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 23:33:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 23:33:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:33:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 23:33:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 23:33:09,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 23:33:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 23:33:09,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 23:33:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 23:33:09,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 23:33:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-29 23:33:09,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-29 23:33:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:33:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 23:33:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:33:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:33:09,847 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-29 23:33:12,510 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:33:12,510 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 23:33:12,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:33:12 BoogieIcfgContainer [2020-11-29 23:33:12,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:33:12,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:33:12,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:33:12,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:33:12,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:33:08" (1/3) ... [2020-11-29 23:33:12,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f5fc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:33:12, skipping insertion in model container [2020-11-29 23:33:12,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:33:09" (2/3) ... [2020-11-29 23:33:12,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f5fc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:33:12, skipping insertion in model container [2020-11-29 23:33:12,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:33:12" (3/3) ... [2020-11-29 23:33:12,521 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.opt.i [2020-11-29 23:33:12,531 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 23:33:12,532 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:33:12,536 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 23:33:12,536 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 23:33:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,584 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,584 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,592 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,592 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,592 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,592 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,593 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,593 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,593 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,593 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,593 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,593 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,602 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,606 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,608 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,611 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,612 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:33:12,615 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 23:33:12,626 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 23:33:12,653 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:33:12,653 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 23:33:12,653 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:33:12,653 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:33:12,653 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:33:12,653 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:33:12,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:33:12,654 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:33:12,668 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 23:33:12,670 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-29 23:33:12,673 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-29 23:33:12,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-29 23:33:12,743 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-29 23:33:12,743 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 23:33:12,747 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 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2020-11-29 23:33:12,754 INFO L116 LiptonReduction]: Number of co-enabled transitions 3006 [2020-11-29 23:33:13,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:13,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:13,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:13,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:13,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,481 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 23:33:13,616 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 23:33:13,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:13,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:13,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:13,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:13,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:13,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:13,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:13,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:13,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:13,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:13,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:13,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:13,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:13,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:13,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:13,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:13,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:13,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:13,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:13,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:13,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:13,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:13,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:14,217 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-29 23:33:14,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:14,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:14,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:14,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:14,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-11-29 23:33:14,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:14,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:14,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:14,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:14,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:15,905 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-29 23:33:15,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-29 23:33:15,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:15,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:15,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,134 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-11-29 23:33:17,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 23:33:17,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 23:33:17,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:17,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:17,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:17,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:17,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:17,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:17,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:18,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:18,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:18,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-29 23:33:18,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:18,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:18,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:18,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:18,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:18,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:18,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:18,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:18,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:18,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:18,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:18,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:18,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:18,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:33:18,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:18,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:18,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:18,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:18,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:18,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:19,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:19,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:33:19,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:19,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:19,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:19,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:19,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-29 23:33:19,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:19,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:19,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:19,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:19,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:19,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:19,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:19,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:19,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:19,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 23:33:19,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:19,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:19,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:19,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 23:33:19,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:19,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:19,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:19,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:33:19,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:20,123 WARN L193 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-11-29 23:33:20,421 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-29 23:33:21,018 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-29 23:33:21,294 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-29 23:33:22,327 WARN L193 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2020-11-29 23:33:22,791 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-29 23:33:22,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:22,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:22,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:22,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:22,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:22,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:22,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:22,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:22,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:22,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:22,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:22,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:22,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:22,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:22,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:22,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:23,214 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-29 23:33:23,346 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-29 23:33:23,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:23,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:23,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:23,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:23,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:23,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:23,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:23,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:33:23,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:23,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:23,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:23,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:33:23,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:33:23,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:23,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:33:23,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:33:23,884 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 122 [2020-11-29 23:33:24,096 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-29 23:33:24,147 INFO L131 LiptonReduction]: Checked pairs total: 9177 [2020-11-29 23:33:24,147 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-29 23:33:24,153 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-11-29 23:33:24,472 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-11-29 23:33:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-11-29 23:33:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-29 23:33:24,479 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:24,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-29 23:33:24,480 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:24,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1198314430, now seen corresponding path program 1 times [2020-11-29 23:33:24,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:24,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783729763] [2020-11-29 23:33:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:24,762 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-29 23:33:24,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783729763] [2020-11-29 23:33:24,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:24,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 23:33:24,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11289859] [2020-11-29 23:33:24,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:33:24,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:33:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:33:24,780 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-11-29 23:33:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:24,925 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-11-29 23:33:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:33:24,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-29 23:33:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:24,991 INFO L225 Difference]: With dead ends: 4062 [2020-11-29 23:33:24,991 INFO L226 Difference]: Without dead ends: 3312 [2020-11-29 23:33:24,993 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-29 23:33:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-11-29 23:33:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-11-29 23:33:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-11-29 23:33:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-11-29 23:33:25,251 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 5 [2020-11-29 23:33:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:25,251 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-11-29 23:33:25,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:33:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-11-29 23:33:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 23:33:25,255 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:25,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:25,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 23:33:25,255 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash -833643970, now seen corresponding path program 1 times [2020-11-29 23:33:25,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:25,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467598053] [2020-11-29 23:33:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:25,397 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-29 23:33:25,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467598053] [2020-11-29 23:33:25,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:25,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 23:33:25,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819912253] [2020-11-29 23:33:25,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:33:25,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:33:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:33:25,400 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-11-29 23:33:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:25,470 INFO L93 Difference]: Finished difference Result 3262 states and 12720 transitions. [2020-11-29 23:33:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:33:25,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-29 23:33:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:25,507 INFO L225 Difference]: With dead ends: 3262 [2020-11-29 23:33:25,507 INFO L226 Difference]: Without dead ends: 3262 [2020-11-29 23:33:25,508 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-29 23:33:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-11-29 23:33:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-11-29 23:33:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-11-29 23:33:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 12720 transitions. [2020-11-29 23:33:25,660 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 12720 transitions. Word has length 11 [2020-11-29 23:33:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:25,660 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 12720 transitions. [2020-11-29 23:33:25,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:33:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 12720 transitions. [2020-11-29 23:33:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 23:33:25,668 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:25,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:25,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 23:33:25,669 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash -74427126, now seen corresponding path program 1 times [2020-11-29 23:33:25,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:25,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220202410] [2020-11-29 23:33:25,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:25,772 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-29 23:33:25,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220202410] [2020-11-29 23:33:25,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:25,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 23:33:25,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852583271] [2020-11-29 23:33:25,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:33:25,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:25,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:33:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:33:25,774 INFO L87 Difference]: Start difference. First operand 3262 states and 12720 transitions. Second operand 3 states. [2020-11-29 23:33:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:25,819 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-11-29 23:33:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:33:25,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-29 23:33:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:25,849 INFO L225 Difference]: With dead ends: 3062 [2020-11-29 23:33:25,849 INFO L226 Difference]: Without dead ends: 3062 [2020-11-29 23:33:25,850 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-29 23:33:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-11-29 23:33:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-11-29 23:33:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-11-29 23:33:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-11-29 23:33:26,063 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 12 [2020-11-29 23:33:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:26,063 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-11-29 23:33:26,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:33:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-11-29 23:33:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 23:33:26,064 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:26,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:26,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 23:33:26,065 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1984790262, now seen corresponding path program 1 times [2020-11-29 23:33:26,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:26,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931975473] [2020-11-29 23:33:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:26,182 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-29 23:33:26,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931975473] [2020-11-29 23:33:26,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:26,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 23:33:26,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451842762] [2020-11-29 23:33:26,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:33:26,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:26,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:33:26,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:33:26,184 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states. [2020-11-29 23:33:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:26,254 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-11-29 23:33:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:33:26,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-29 23:33:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:26,284 INFO L225 Difference]: With dead ends: 3022 [2020-11-29 23:33:26,284 INFO L226 Difference]: Without dead ends: 3022 [2020-11-29 23:33:26,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:33:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-11-29 23:33:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-11-29 23:33:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-11-29 23:33:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-11-29 23:33:26,399 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-11-29 23:33:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:26,400 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-11-29 23:33:26,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:33:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-11-29 23:33:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 23:33:26,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:26,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:26,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 23:33:26,403 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash -447066724, now seen corresponding path program 1 times [2020-11-29 23:33:26,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:26,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411298715] [2020-11-29 23:33:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:26,566 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-29 23:33:26,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411298715] [2020-11-29 23:33:26,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:26,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 23:33:26,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633868365] [2020-11-29 23:33:26,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:33:26,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:26,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:33:26,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:33:26,568 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states. [2020-11-29 23:33:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:26,685 INFO L93 Difference]: Finished difference Result 3230 states and 12480 transitions. [2020-11-29 23:33:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:33:26,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-29 23:33:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:26,718 INFO L225 Difference]: With dead ends: 3230 [2020-11-29 23:33:26,718 INFO L226 Difference]: Without dead ends: 3230 [2020-11-29 23:33:26,719 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-29 23:33:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2020-11-29 23:33:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2020-11-29 23:33:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2020-11-29 23:33:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 12480 transitions. [2020-11-29 23:33:26,915 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 12480 transitions. Word has length 14 [2020-11-29 23:33:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:26,916 INFO L481 AbstractCegarLoop]: Abstraction has 3230 states and 12480 transitions. [2020-11-29 23:33:26,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:33:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 12480 transitions. [2020-11-29 23:33:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 23:33:26,920 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:26,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:26,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 23:33:26,921 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash -20034863, now seen corresponding path program 1 times [2020-11-29 23:33:26,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:26,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224954304] [2020-11-29 23:33:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:27,036 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-29 23:33:27,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224954304] [2020-11-29 23:33:27,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:27,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:33:27,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153485379] [2020-11-29 23:33:27,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 23:33:27,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:27,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:33:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:33:27,038 INFO L87 Difference]: Start difference. First operand 3230 states and 12480 transitions. Second operand 5 states. [2020-11-29 23:33:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:27,175 INFO L93 Difference]: Finished difference Result 3282 states and 12683 transitions. [2020-11-29 23:33:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:33:27,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-29 23:33:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:27,194 INFO L225 Difference]: With dead ends: 3282 [2020-11-29 23:33:27,194 INFO L226 Difference]: Without dead ends: 3282 [2020-11-29 23:33:27,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:33:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2020-11-29 23:33:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3282. [2020-11-29 23:33:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2020-11-29 23:33:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 12683 transitions. [2020-11-29 23:33:27,347 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 12683 transitions. Word has length 15 [2020-11-29 23:33:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:27,348 INFO L481 AbstractCegarLoop]: Abstraction has 3282 states and 12683 transitions. [2020-11-29 23:33:27,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 23:33:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 12683 transitions. [2020-11-29 23:33:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 23:33:27,353 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:27,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:27,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 23:33:27,354 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1502094586, now seen corresponding path program 1 times [2020-11-29 23:33:27,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:27,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314686661] [2020-11-29 23:33:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:27,607 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-29 23:33:27,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314686661] [2020-11-29 23:33:27,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:27,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:33:27,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171619012] [2020-11-29 23:33:27,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:33:27,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:33:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:33:27,609 INFO L87 Difference]: Start difference. First operand 3282 states and 12683 transitions. Second operand 6 states. [2020-11-29 23:33:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:27,760 INFO L93 Difference]: Finished difference Result 3398 states and 13061 transitions. [2020-11-29 23:33:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:33:27,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-29 23:33:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:27,777 INFO L225 Difference]: With dead ends: 3398 [2020-11-29 23:33:27,777 INFO L226 Difference]: Without dead ends: 3398 [2020-11-29 23:33:27,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:33:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2020-11-29 23:33:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3170. [2020-11-29 23:33:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2020-11-29 23:33:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12227 transitions. [2020-11-29 23:33:27,931 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12227 transitions. Word has length 16 [2020-11-29 23:33:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:27,931 INFO L481 AbstractCegarLoop]: Abstraction has 3170 states and 12227 transitions. [2020-11-29 23:33:27,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:33:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12227 transitions. [2020-11-29 23:33:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 23:33:27,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:27,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:27,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 23:33:27,939 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1827863841, now seen corresponding path program 1 times [2020-11-29 23:33:27,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:27,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808617235] [2020-11-29 23:33:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:28,033 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-29 23:33:28,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808617235] [2020-11-29 23:33:28,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:28,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:33:28,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629082099] [2020-11-29 23:33:28,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 23:33:28,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:28,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:33:28,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:33:28,035 INFO L87 Difference]: Start difference. First operand 3170 states and 12227 transitions. Second operand 5 states. [2020-11-29 23:33:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:28,158 INFO L93 Difference]: Finished difference Result 3444 states and 13370 transitions. [2020-11-29 23:33:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:33:28,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-29 23:33:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:28,178 INFO L225 Difference]: With dead ends: 3444 [2020-11-29 23:33:28,178 INFO L226 Difference]: Without dead ends: 3444 [2020-11-29 23:33:28,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:33:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2020-11-29 23:33:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3444. [2020-11-29 23:33:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2020-11-29 23:33:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 13370 transitions. [2020-11-29 23:33:28,300 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 13370 transitions. Word has length 16 [2020-11-29 23:33:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:28,301 INFO L481 AbstractCegarLoop]: Abstraction has 3444 states and 13370 transitions. [2020-11-29 23:33:28,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 23:33:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 13370 transitions. [2020-11-29 23:33:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 23:33:28,306 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:28,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:28,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 23:33:28,306 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash -621081491, now seen corresponding path program 2 times [2020-11-29 23:33:28,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:28,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813017279] [2020-11-29 23:33:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:28,457 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-29 23:33:28,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813017279] [2020-11-29 23:33:28,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:28,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:33:28,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737719373] [2020-11-29 23:33:28,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:33:28,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:28,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:33:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:33:28,459 INFO L87 Difference]: Start difference. First operand 3444 states and 13370 transitions. Second operand 6 states. [2020-11-29 23:33:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:28,865 INFO L93 Difference]: Finished difference Result 3818 states and 14855 transitions. [2020-11-29 23:33:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 23:33:28,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-29 23:33:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:28,886 INFO L225 Difference]: With dead ends: 3818 [2020-11-29 23:33:28,886 INFO L226 Difference]: Without dead ends: 3818 [2020-11-29 23:33:28,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:33:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2020-11-29 23:33:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3462. [2020-11-29 23:33:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2020-11-29 23:33:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 13381 transitions. [2020-11-29 23:33:29,012 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 13381 transitions. Word has length 16 [2020-11-29 23:33:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:29,013 INFO L481 AbstractCegarLoop]: Abstraction has 3462 states and 13381 transitions. [2020-11-29 23:33:29,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:33:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 13381 transitions. [2020-11-29 23:33:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 23:33:29,018 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:29,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:29,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 23:33:29,019 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -227365157, now seen corresponding path program 1 times [2020-11-29 23:33:29,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:29,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973754445] [2020-11-29 23:33:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:29,283 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-29 23:33:29,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973754445] [2020-11-29 23:33:29,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:29,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:33:29,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315875439] [2020-11-29 23:33:29,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:33:29,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:33:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:33:29,285 INFO L87 Difference]: Start difference. First operand 3462 states and 13381 transitions. Second operand 6 states. [2020-11-29 23:33:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:29,430 INFO L93 Difference]: Finished difference Result 3730 states and 14299 transitions. [2020-11-29 23:33:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:33:29,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-29 23:33:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:29,446 INFO L225 Difference]: With dead ends: 3730 [2020-11-29 23:33:29,446 INFO L226 Difference]: Without dead ends: 3730 [2020-11-29 23:33:29,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:33:29,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2020-11-29 23:33:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3538. [2020-11-29 23:33:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3538 states. [2020-11-29 23:33:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 13541 transitions. [2020-11-29 23:33:29,571 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 13541 transitions. Word has length 16 [2020-11-29 23:33:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:29,573 INFO L481 AbstractCegarLoop]: Abstraction has 3538 states and 13541 transitions. [2020-11-29 23:33:29,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:33:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 13541 transitions. [2020-11-29 23:33:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 23:33:29,579 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:29,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:29,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 23:33:29,580 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash -238435877, now seen corresponding path program 1 times [2020-11-29 23:33:29,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:29,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36025170] [2020-11-29 23:33:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:29,698 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-29 23:33:29,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36025170] [2020-11-29 23:33:29,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:29,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:33:29,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104669441] [2020-11-29 23:33:29,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:33:29,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:33:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:33:29,699 INFO L87 Difference]: Start difference. First operand 3538 states and 13541 transitions. Second operand 4 states. [2020-11-29 23:33:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:29,759 INFO L93 Difference]: Finished difference Result 3610 states and 12622 transitions. [2020-11-29 23:33:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:33:29,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-29 23:33:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:29,769 INFO L225 Difference]: With dead ends: 3610 [2020-11-29 23:33:29,769 INFO L226 Difference]: Without dead ends: 2668 [2020-11-29 23:33:29,769 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-29 23:33:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2020-11-29 23:33:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2020-11-29 23:33:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2668 states. [2020-11-29 23:33:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 9191 transitions. [2020-11-29 23:33:29,841 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 9191 transitions. Word has length 16 [2020-11-29 23:33:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:29,842 INFO L481 AbstractCegarLoop]: Abstraction has 2668 states and 9191 transitions. [2020-11-29 23:33:29,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:33:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 9191 transitions. [2020-11-29 23:33:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 23:33:29,849 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:29,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:29,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 23:33:29,850 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1097563260, now seen corresponding path program 1 times [2020-11-29 23:33:29,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:29,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582002849] [2020-11-29 23:33:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:29,921 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-29 23:33:29,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582002849] [2020-11-29 23:33:29,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:29,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:33:29,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519929961] [2020-11-29 23:33:29,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 23:33:29,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:33:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:33:29,923 INFO L87 Difference]: Start difference. First operand 2668 states and 9191 transitions. Second operand 5 states. [2020-11-29 23:33:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:29,986 INFO L93 Difference]: Finished difference Result 2274 states and 7286 transitions. [2020-11-29 23:33:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:33:29,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-29 23:33:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:29,991 INFO L225 Difference]: With dead ends: 2274 [2020-11-29 23:33:29,992 INFO L226 Difference]: Without dead ends: 1722 [2020-11-29 23:33:29,992 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-29 23:33:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-11-29 23:33:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2020-11-29 23:33:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-11-29 23:33:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 5407 transitions. [2020-11-29 23:33:30,035 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 5407 transitions. Word has length 17 [2020-11-29 23:33:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:30,035 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 5407 transitions. [2020-11-29 23:33:30,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 23:33:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 5407 transitions. [2020-11-29 23:33:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 23:33:30,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:30,039 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-29 23:33:30,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 23:33:30,039 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 379995694, now seen corresponding path program 1 times [2020-11-29 23:33:30,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:30,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121551768] [2020-11-29 23:33:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:30,130 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-29 23:33:30,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121551768] [2020-11-29 23:33:30,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:30,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:33:30,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265916113] [2020-11-29 23:33:30,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:33:30,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:33:30,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:33:30,132 INFO L87 Difference]: Start difference. First operand 1722 states and 5407 transitions. Second operand 6 states. [2020-11-29 23:33:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:30,212 INFO L93 Difference]: Finished difference Result 1535 states and 4805 transitions. [2020-11-29 23:33:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 23:33:30,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-29 23:33:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:30,218 INFO L225 Difference]: With dead ends: 1535 [2020-11-29 23:33:30,218 INFO L226 Difference]: Without dead ends: 1381 [2020-11-29 23:33:30,219 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-29 23:33:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-11-29 23:33:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1181. [2020-11-29 23:33:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2020-11-29 23:33:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3716 transitions. [2020-11-29 23:33:30,249 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3716 transitions. Word has length 20 [2020-11-29 23:33:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:30,249 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 3716 transitions. [2020-11-29 23:33:30,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:33:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3716 transitions. [2020-11-29 23:33:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 23:33:30,252 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:30,252 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] [2020-11-29 23:33:30,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 23:33:30,253 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1783621777, now seen corresponding path program 1 times [2020-11-29 23:33:30,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:30,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450309052] [2020-11-29 23:33:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:30,308 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-29 23:33:30,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450309052] [2020-11-29 23:33:30,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:30,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:33:30,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087080430] [2020-11-29 23:33:30,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:33:30,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:33:30,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:33:30,310 INFO L87 Difference]: Start difference. First operand 1181 states and 3716 transitions. Second operand 4 states. [2020-11-29 23:33:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:30,336 INFO L93 Difference]: Finished difference Result 1540 states and 4749 transitions. [2020-11-29 23:33:30,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:33:30,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-29 23:33:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:30,340 INFO L225 Difference]: With dead ends: 1540 [2020-11-29 23:33:30,340 INFO L226 Difference]: Without dead ends: 1184 [2020-11-29 23:33:30,340 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-29 23:33:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-11-29 23:33:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1141. [2020-11-29 23:33:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2020-11-29 23:33:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3494 transitions. [2020-11-29 23:33:30,391 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3494 transitions. Word has length 24 [2020-11-29 23:33:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:30,391 INFO L481 AbstractCegarLoop]: Abstraction has 1141 states and 3494 transitions. [2020-11-29 23:33:30,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:33:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3494 transitions. [2020-11-29 23:33:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 23:33:30,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:30,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:30,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 23:33:30,396 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:30,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1097414211, now seen corresponding path program 1 times [2020-11-29 23:33:30,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:30,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208357135] [2020-11-29 23:33:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:30,478 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-29 23:33:30,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208357135] [2020-11-29 23:33:30,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:30,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:33:30,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91917531] [2020-11-29 23:33:30,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:33:30,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:30,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:33:30,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:33:30,480 INFO L87 Difference]: Start difference. First operand 1141 states and 3494 transitions. Second operand 4 states. [2020-11-29 23:33:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:30,510 INFO L93 Difference]: Finished difference Result 1654 states and 4988 transitions. [2020-11-29 23:33:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:33:30,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-29 23:33:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:30,514 INFO L225 Difference]: With dead ends: 1654 [2020-11-29 23:33:30,514 INFO L226 Difference]: Without dead ends: 942 [2020-11-29 23:33:30,515 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-29 23:33:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2020-11-29 23:33:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 939. [2020-11-29 23:33:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2020-11-29 23:33:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 2684 transitions. [2020-11-29 23:33:30,543 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 2684 transitions. Word has length 24 [2020-11-29 23:33:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:30,543 INFO L481 AbstractCegarLoop]: Abstraction has 939 states and 2684 transitions. [2020-11-29 23:33:30,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:33:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 2684 transitions. [2020-11-29 23:33:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 23:33:30,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:30,548 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] [2020-11-29 23:33:30,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 23:33:30,548 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1187502413, now seen corresponding path program 2 times [2020-11-29 23:33:30,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:30,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733595717] [2020-11-29 23:33:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:30,674 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-29 23:33:30,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733595717] [2020-11-29 23:33:30,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:30,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 23:33:30,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755293469] [2020-11-29 23:33:30,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 23:33:30,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:30,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 23:33:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:33:30,675 INFO L87 Difference]: Start difference. First operand 939 states and 2684 transitions. Second operand 7 states. [2020-11-29 23:33:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:30,766 INFO L93 Difference]: Finished difference Result 910 states and 2626 transitions. [2020-11-29 23:33:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:33:30,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-29 23:33:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:30,768 INFO L225 Difference]: With dead ends: 910 [2020-11-29 23:33:30,768 INFO L226 Difference]: Without dead ends: 357 [2020-11-29 23:33:30,769 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-29 23:33:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-11-29 23:33:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2020-11-29 23:33:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-11-29 23:33:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 964 transitions. [2020-11-29 23:33:30,780 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 964 transitions. Word has length 24 [2020-11-29 23:33:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:30,780 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 964 transitions. [2020-11-29 23:33:30,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 23:33:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 964 transitions. [2020-11-29 23:33:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 23:33:30,782 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:30,782 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, 1] [2020-11-29 23:33:30,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 23:33:30,782 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash 96302780, now seen corresponding path program 1 times [2020-11-29 23:33:30,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:30,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321770363] [2020-11-29 23:33:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:30,849 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-29 23:33:30,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321770363] [2020-11-29 23:33:30,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:30,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 23:33:30,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887529712] [2020-11-29 23:33:30,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:33:30,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:33:30,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:33:30,851 INFO L87 Difference]: Start difference. First operand 357 states and 964 transitions. Second operand 3 states. [2020-11-29 23:33:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:30,870 INFO L93 Difference]: Finished difference Result 512 states and 1386 transitions. [2020-11-29 23:33:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:33:30,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-29 23:33:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:30,872 INFO L225 Difference]: With dead ends: 512 [2020-11-29 23:33:30,872 INFO L226 Difference]: Without dead ends: 221 [2020-11-29 23:33:30,872 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-29 23:33:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-29 23:33:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-11-29 23:33:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-11-29 23:33:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 560 transitions. [2020-11-29 23:33:30,879 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 560 transitions. Word has length 28 [2020-11-29 23:33:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:30,879 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 560 transitions. [2020-11-29 23:33:30,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:33:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 560 transitions. [2020-11-29 23:33:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 23:33:30,880 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:30,880 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, 1] [2020-11-29 23:33:30,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 23:33:30,880 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:33:30,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:30,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1955985784, now seen corresponding path program 2 times [2020-11-29 23:33:30,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:30,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753166901] [2020-11-29 23:33:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:33:30,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:33:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:33:31,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:33:31,081 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:33:31,082 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 23:33:31,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 23:33:31,084 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-29 23:33:31,111 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1198] [1198] L3-->L869: Formula: (let ((.cse8 (= (mod ~x$w_buff1_used~0_In-2133335381 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-2133335381 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-2133335381 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-2133335381 256) 0))) (let ((.cse3 (or .cse6 .cse7)) (.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-2133335381 0)) (= ~x$r_buff1_thd0~0_In-2133335381 ~x$r_buff1_thd0~0_Out-2133335381) (or (and .cse0 (= ~x$w_buff1_used~0_Out-2133335381 0) .cse1) (and (= ~x$w_buff1_used~0_Out-2133335381 ~x$w_buff1_used~0_In-2133335381) .cse2)) (or (and .cse3 (= ~x$w_buff0_used~0_In-2133335381 ~x$w_buff0_used~0_Out-2133335381)) (and (= ~x$w_buff0_used~0_Out-2133335381 0) .cse4 .cse5)) (= ~x$r_buff0_thd0~0_Out-2133335381 ~x$r_buff0_thd0~0_In-2133335381) (or (and .cse3 (or (and (= ~x~0_Out-2133335381 ~x~0_In-2133335381) .cse2) (and .cse0 (= ~x~0_Out-2133335381 ~x$w_buff1~0_In-2133335381) .cse1))) (and (= ~x$w_buff0~0_In-2133335381 ~x~0_Out-2133335381) .cse4 .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2133335381, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2133335381, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-2133335381, ~x$w_buff1~0=~x$w_buff1~0_In-2133335381, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2133335381, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2133335381, ~x~0=~x~0_In-2133335381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2133335381} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-2133335381, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-2133335381, ~x$w_buff1~0=~x$w_buff1~0_In-2133335381, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2133335381|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-2133335381, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2133335381|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2133335381|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2133335381|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-2133335381, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-2133335381|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-2133335381, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2133335381|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-2133335381, ~x~0=~x~0_Out-2133335381} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~x$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-11-29 23:33:31,118 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-29 23:33:31,119 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [769] [2020-11-29 23:33:31,123 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-29 23:33:31,123 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,123 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-29 23:33:31,123 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,123 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-29 23:33:31,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,124 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-29 23:33:31,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,124 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-29 23:33:31,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,124 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-29 23:33:31,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,126 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-29 23:33:31,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,126 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-29 23:33:31,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,127 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-29 23:33:31,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,127 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-29 23:33:31,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,127 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-29 23:33:31,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,128 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-29 23:33:31,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,128 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-29 23:33:31,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,129 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-29 23:33:31,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,129 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-29 23:33:31,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,129 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-29 23:33:31,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,130 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-29 23:33:31,130 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,130 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-29 23:33:31,130 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,135 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-29 23:33:31,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,135 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-29 23:33:31,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,136 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-29 23:33:31,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,136 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-29 23:33:31,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,136 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-29 23:33:31,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,137 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-29 23:33:31,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,138 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-29 23:33:31,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,138 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-29 23:33:31,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,138 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-29 23:33:31,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,139 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-29 23:33:31,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,139 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-29 23:33:31,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,139 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-29 23:33:31,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,140 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-29 23:33:31,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,140 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-29 23:33:31,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:33:31 BasicIcfg [2020-11-29 23:33:31,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 23:33:31,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:33:31,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:33:31,243 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:33:31,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:33:12" (3/4) ... [2020-11-29 23:33:31,245 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 23:33:31,269 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1198] [1198] L3-->L869: Formula: (let ((.cse8 (= (mod ~x$w_buff1_used~0_In-2133335381 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-2133335381 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-2133335381 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-2133335381 256) 0))) (let ((.cse3 (or .cse6 .cse7)) (.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-2133335381 0)) (= ~x$r_buff1_thd0~0_In-2133335381 ~x$r_buff1_thd0~0_Out-2133335381) (or (and .cse0 (= ~x$w_buff1_used~0_Out-2133335381 0) .cse1) (and (= ~x$w_buff1_used~0_Out-2133335381 ~x$w_buff1_used~0_In-2133335381) .cse2)) (or (and .cse3 (= ~x$w_buff0_used~0_In-2133335381 ~x$w_buff0_used~0_Out-2133335381)) (and (= ~x$w_buff0_used~0_Out-2133335381 0) .cse4 .cse5)) (= ~x$r_buff0_thd0~0_Out-2133335381 ~x$r_buff0_thd0~0_In-2133335381) (or (and .cse3 (or (and (= ~x~0_Out-2133335381 ~x~0_In-2133335381) .cse2) (and .cse0 (= ~x~0_Out-2133335381 ~x$w_buff1~0_In-2133335381) .cse1))) (and (= ~x$w_buff0~0_In-2133335381 ~x~0_Out-2133335381) .cse4 .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2133335381, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2133335381, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-2133335381, ~x$w_buff1~0=~x$w_buff1~0_In-2133335381, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2133335381, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2133335381, ~x~0=~x~0_In-2133335381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2133335381} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-2133335381, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-2133335381, ~x$w_buff1~0=~x$w_buff1~0_In-2133335381, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2133335381|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-2133335381, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2133335381|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2133335381|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2133335381|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-2133335381, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-2133335381|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-2133335381, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2133335381|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-2133335381, ~x~0=~x~0_Out-2133335381} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~x$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-11-29 23:33:31,271 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-29 23:33:31,271 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [769] [2020-11-29 23:33:31,271 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-29 23:33:31,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,272 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-29 23:33:31,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,272 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-29 23:33:31,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,272 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-29 23:33:31,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,273 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-29 23:33:31,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,273 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-29 23:33:31,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,274 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-29 23:33:31,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,274 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-29 23:33:31,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,274 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-29 23:33:31,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,274 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-29 23:33:31,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,275 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-29 23:33:31,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,275 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-29 23:33:31,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,275 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-29 23:33:31,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,276 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-29 23:33:31,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,276 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-29 23:33:31,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,276 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-29 23:33:31,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,277 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-29 23:33:31,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,277 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-29 23:33:31,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,277 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-29 23:33:31,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,278 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-29 23:33:31,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,278 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-29 23:33:31,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,278 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-29 23:33:31,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,278 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-29 23:33:31,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,279 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-29 23:33:31,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,279 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-29 23:33:31,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,279 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-29 23:33:31,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,280 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-29 23:33:31,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,280 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-29 23:33:31,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,280 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-29 23:33:31,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,281 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-29 23:33:31,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,281 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-29 23:33:31,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,281 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-29 23:33:31,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:33:31,396 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_30a08e5c-c5b4-4d31-8147-ba51d8df1c6c/bin/uautomizer/witness.graphml [2020-11-29 23:33:31,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:33:31,402 INFO L168 Benchmark]: Toolchain (without parser) took 22612.46 ms. Allocated memory was 96.5 MB in the beginning and 583.0 MB in the end (delta: 486.5 MB). Free memory was 67.2 MB in the beginning and 311.5 MB in the end (delta: -244.3 MB). Peak memory consumption was 242.8 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:31,404 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 96.5 MB. Free memory was 52.4 MB in the beginning and 52.3 MB in the end (delta: 59.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:33:31,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 847.79 ms. Allocated memory was 96.5 MB in the beginning and 130.0 MB in the end (delta: 33.6 MB). Free memory was 67.0 MB in the beginning and 103.5 MB in the end (delta: -36.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:31,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.81 ms. Allocated memory is still 130.0 MB. Free memory was 103.5 MB in the beginning and 104.5 MB in the end (delta: -975.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:31,405 INFO L168 Benchmark]: Boogie Preprocessor took 67.36 ms. Allocated memory is still 130.0 MB. Free memory was 104.5 MB in the beginning and 101.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:31,405 INFO L168 Benchmark]: RCFGBuilder took 2736.25 ms. Allocated memory was 130.0 MB in the beginning and 157.3 MB in the end (delta: 27.3 MB). Free memory was 101.7 MB in the beginning and 95.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 70.4 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:31,406 INFO L168 Benchmark]: TraceAbstraction took 18728.48 ms. Allocated memory was 157.3 MB in the beginning and 583.0 MB in the end (delta: 425.7 MB). Free memory was 94.4 MB in the beginning and 336.7 MB in the end (delta: -242.3 MB). Peak memory consumption was 184.5 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:31,406 INFO L168 Benchmark]: Witness Printer took 153.76 ms. Allocated memory is still 583.0 MB. Free memory was 336.7 MB in the beginning and 311.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:31,409 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.22 ms. Allocated memory is still 96.5 MB. Free memory was 52.4 MB in the beginning and 52.3 MB in the end (delta: 59.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 847.79 ms. Allocated memory was 96.5 MB in the beginning and 130.0 MB in the end (delta: 33.6 MB). Free memory was 67.0 MB in the beginning and 103.5 MB in the end (delta: -36.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.81 ms. Allocated memory is still 130.0 MB. Free memory was 103.5 MB in the beginning and 104.5 MB in the end (delta: -975.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.36 ms. Allocated memory is still 130.0 MB. Free memory was 104.5 MB in the beginning and 101.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2736.25 ms. Allocated memory was 130.0 MB in the beginning and 157.3 MB in the end (delta: 27.3 MB). Free memory was 101.7 MB in the beginning and 95.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 70.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18728.48 ms. Allocated memory was 157.3 MB in the beginning and 583.0 MB in the end (delta: 425.7 MB). Free memory was 94.4 MB in the beginning and 336.7 MB in the end (delta: -242.3 MB). Peak memory consumption was 184.5 MB. Max. memory is 16.1 GB. * Witness Printer took 153.76 ms. Allocated memory is still 583.0 MB. Free memory was 336.7 MB in the beginning and 311.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1971 VarBasedMoverChecksPositive, 106 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 79 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 220 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.4s, 131 PlacesBefore, 47 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 3006 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 104 TotalNumberOfCompositions, 9177 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t741; [L852] FCALL, FORK 0 pthread_create(&t741, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t742; [L854] FCALL, FORK 0 pthread_create(&t742, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t743; [L856] FCALL, FORK 0 pthread_create(&t743, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t744; [L858] FCALL, FORK 0 pthread_create(&t744, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix027_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.8s, HoareTripleCheckerStatistics: 608 SDtfs, 787 SDslu, 948 SDs, 0 SdLazy, 433 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 29508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...