./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_pso.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_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/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 828219f335bdf28f6feb9ae7244acc963fe23587 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:22:37,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:22:37,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:22:37,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:22:37,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:22:37,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:22:37,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:22:37,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:22:37,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:22:37,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:22:37,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:22:37,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:22:37,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:22:37,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:22:37,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:22:37,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:22:37,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:22:37,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:22:37,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:22:37,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:22:37,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:22:37,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:22:37,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:22:37,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:22:37,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:22:37,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:22:37,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:22:37,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:22:37,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:22:37,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:22:37,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:22:37,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:22:37,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:22:37,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:22:37,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:22:37,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:22:37,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:22:37,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:22:37,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:22:37,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:22:37,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:22:37,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:22:37,613 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:22:37,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:22:37,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:22:37,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:22:37,616 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:22:37,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:22:37,617 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:22:37,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:22:37,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:22:37,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:22:37,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:22:37,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:22:37,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:22:37,619 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:22:37,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:22:37,620 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:22:37,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:22:37,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:22:37,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:22:37,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:22:37,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:22:37,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:22:37,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:22:37,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:22:37,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:22:37,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:22:37,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:22:37,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:22:37,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:22:37,622 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_0fca4846-5686-420d-82be-4ca9270ae440/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_0fca4846-5686-420d-82be-4ca9270ae440/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 -> 828219f335bdf28f6feb9ae7244acc963fe23587 [2020-11-30 00:22:37,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:22:37,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:22:37,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:22:37,914 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:22:37,915 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:22:37,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix047_pso.opt.i [2020-11-30 00:22:37,982 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/data/2bb910395/6d009a0ebf8043608dad1a480497d69a/FLAG8425a1fd3 [2020-11-30 00:22:38,550 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:22:38,550 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/sv-benchmarks/c/pthread-wmm/mix047_pso.opt.i [2020-11-30 00:22:38,567 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/data/2bb910395/6d009a0ebf8043608dad1a480497d69a/FLAG8425a1fd3 [2020-11-30 00:22:38,846 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/data/2bb910395/6d009a0ebf8043608dad1a480497d69a [2020-11-30 00:22:38,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:22:38,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:22:38,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:22:38,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:22:38,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:22:38,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:22:38" (1/1) ... [2020-11-30 00:22:38,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212e588b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:38, skipping insertion in model container [2020-11-30 00:22:38,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:22:38" (1/1) ... [2020-11-30 00:22:38,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:22:38,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:22:39,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:22:39,477 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:22:39,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:22:39,656 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:22:39,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39 WrapperNode [2020-11-30 00:22:39,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:22:39,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:22:39,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:22:39,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:22:39,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:22:39,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:22:39,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:22:39,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:22:39,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... [2020-11-30 00:22:39,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:22:39,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:22:39,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:22:39,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:22:39,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:22:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:22:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 00:22:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:22:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:22:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 00:22:39,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 00:22:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 00:22:39,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 00:22:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 00:22:39,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 00:22:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-30 00:22:39,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-30 00:22:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:22:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 00:22:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:22:39,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:22:39,865 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 00:22:42,275 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:22:42,275 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:22:42,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:22:42 BoogieIcfgContainer [2020-11-30 00:22:42,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:22:42,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:22:42,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:22:42,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:22:42,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:22:38" (1/3) ... [2020-11-30 00:22:42,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4c95f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:22:42, skipping insertion in model container [2020-11-30 00:22:42,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:39" (2/3) ... [2020-11-30 00:22:42,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4c95f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:22:42, skipping insertion in model container [2020-11-30 00:22:42,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:22:42" (3/3) ... [2020-11-30 00:22:42,286 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_pso.opt.i [2020-11-30 00:22:42,298 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 00:22:42,298 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:22:42,303 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 00:22:42,304 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 00:22:42,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,339 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,341 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,341 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,342 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,343 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,345 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,347 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,357 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,358 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,360 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,365 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:22:42,370 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 00:22:42,382 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-30 00:22:42,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:22:42,405 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:22:42,405 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:22:42,405 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:22:42,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:22:42,406 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:22:42,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:22:42,407 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:22:42,427 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 00:22:42,433 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-30 00:22:42,437 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-30 00:22:42,439 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-11-30 00:22:42,493 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-11-30 00:22:42,494 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 00:22:42,498 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-30 00:22:42,503 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-30 00:22:42,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:42,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:42,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:42,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:42,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:42,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:42,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:42,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:42,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:42,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:42,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:42,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:42,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:42,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:43,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:43,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:43,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,582 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-30 00:22:43,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:43,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:43,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:43,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:22:43,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:22:43,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:43,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:43,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:43,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:43,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:43,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:43,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:43,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:22:44,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:44,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:44,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:44,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:44,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:44,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:44,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:44,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:22:44,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:44,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-30 00:22:44,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:22:44,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:22:44,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:22:44,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:44,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:44,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:44,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:45,494 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-11-30 00:22:45,634 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-30 00:22:45,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-30 00:22:45,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:45,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:45,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:45,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:22:45,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:45,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:22:45,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:45,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:22:45,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:45,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-30 00:22:45,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:45,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:45,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:46,946 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 232 DAG size of output: 191 [2020-11-30 00:22:46,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-30 00:22:46,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:46,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-30 00:22:46,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:47,703 WARN L193 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2020-11-30 00:22:47,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:47,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:47,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-30 00:22:47,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:47,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:47,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:47,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:47,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:47,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:47,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:47,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:47,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:47,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:47,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:47,913 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-30 00:22:47,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:47,914 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-30 00:22:47,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:47,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:47,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:22:47,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:47,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,238 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 00:22:48,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:22:48,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-30 00:22:48,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,483 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-30 00:22:48,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,486 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-30 00:22:48,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:22:48,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-30 00:22:48,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,780 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-30 00:22:48,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,782 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-30 00:22:48,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-30 00:22:48,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:22:48,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-30 00:22:48,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,906 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-30 00:22:48,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,908 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-30 00:22:48,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:48,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:22:48,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-30 00:22:48,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:22:49,335 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-30 00:22:49,443 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-30 00:22:49,856 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-30 00:22:50,069 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-30 00:22:50,074 INFO L131 LiptonReduction]: Checked pairs total: 7608 [2020-11-30 00:22:50,075 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-30 00:22:50,079 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-30 00:22:50,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-11-30 00:22:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-11-30 00:22:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:22:50,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:50,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:50,373 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -634987665, now seen corresponding path program 1 times [2020-11-30 00:22:50,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:50,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258410241] [2020-11-30 00:22:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:50,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258410241] [2020-11-30 00:22:50,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:50,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:22:50,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613099348] [2020-11-30 00:22:50,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:22:50,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:50,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:22:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:22:50,744 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-11-30 00:22:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:50,902 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-30 00:22:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:22:50,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:22:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:51,007 INFO L225 Difference]: With dead ends: 3082 [2020-11-30 00:22:51,009 INFO L226 Difference]: Without dead ends: 2602 [2020-11-30 00:22:51,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:22:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-30 00:22:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-30 00:22:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-30 00:22:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-30 00:22:51,292 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-30 00:22:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:51,294 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-30 00:22:51,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:22:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-30 00:22:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:22:51,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:51,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:51,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:22:51,306 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:51,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:51,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1880009126, now seen corresponding path program 1 times [2020-11-30 00:22:51,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:51,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928151109] [2020-11-30 00:22:51,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:51,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928151109] [2020-11-30 00:22:51,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:51,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:22:51,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394612914] [2020-11-30 00:22:51,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:22:51,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:51,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:22:51,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:22:51,503 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-30 00:22:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:51,643 INFO L93 Difference]: Finished difference Result 3062 states and 11482 transitions. [2020-11-30 00:22:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:22:51,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-30 00:22:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:51,672 INFO L225 Difference]: With dead ends: 3062 [2020-11-30 00:22:51,673 INFO L226 Difference]: Without dead ends: 2582 [2020-11-30 00:22:51,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2020-11-30 00:22:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2582. [2020-11-30 00:22:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2020-11-30 00:22:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 9968 transitions. [2020-11-30 00:22:51,800 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 9968 transitions. Word has length 12 [2020-11-30 00:22:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:51,801 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 9968 transitions. [2020-11-30 00:22:51,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:22:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 9968 transitions. [2020-11-30 00:22:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:22:51,804 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:51,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:51,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:22:51,804 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1832422551, now seen corresponding path program 1 times [2020-11-30 00:22:51,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:51,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716026354] [2020-11-30 00:22:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:51,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716026354] [2020-11-30 00:22:51,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:51,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:22:51,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67714996] [2020-11-30 00:22:51,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:22:51,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:51,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:22:51,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:22:51,934 INFO L87 Difference]: Start difference. First operand 2582 states and 9968 transitions. Second operand 4 states. [2020-11-30 00:22:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:51,998 INFO L93 Difference]: Finished difference Result 2752 states and 10304 transitions. [2020-11-30 00:22:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:22:51,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-30 00:22:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:52,025 INFO L225 Difference]: With dead ends: 2752 [2020-11-30 00:22:52,026 INFO L226 Difference]: Without dead ends: 2282 [2020-11-30 00:22:52,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-11-30 00:22:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-11-30 00:22:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-30 00:22:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-11-30 00:22:52,178 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 13 [2020-11-30 00:22:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:52,178 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-11-30 00:22:52,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:22:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-11-30 00:22:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:22:52,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:52,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:52,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:22:52,182 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 970458918, now seen corresponding path program 1 times [2020-11-30 00:22:52,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:52,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178071000] [2020-11-30 00:22:52,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:52,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178071000] [2020-11-30 00:22:52,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:52,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:22:52,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750965273] [2020-11-30 00:22:52,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:22:52,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:22:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:22:52,298 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-11-30 00:22:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:52,355 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-11-30 00:22:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:22:52,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-30 00:22:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:52,378 INFO L225 Difference]: With dead ends: 2538 [2020-11-30 00:22:52,378 INFO L226 Difference]: Without dead ends: 2218 [2020-11-30 00:22:52,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-11-30 00:22:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-11-30 00:22:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-11-30 00:22:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-11-30 00:22:52,465 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-11-30 00:22:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:52,466 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-11-30 00:22:52,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:22:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-11-30 00:22:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:22:52,469 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:52,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:52,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:22:52,470 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash -40609003, now seen corresponding path program 1 times [2020-11-30 00:22:52,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:52,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312760088] [2020-11-30 00:22:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:52,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312760088] [2020-11-30 00:22:52,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:52,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:22:52,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182725074] [2020-11-30 00:22:52,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:22:52,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:22:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:22:52,560 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states. [2020-11-30 00:22:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:52,612 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-11-30 00:22:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:22:52,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-30 00:22:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:52,634 INFO L225 Difference]: With dead ends: 2410 [2020-11-30 00:22:52,634 INFO L226 Difference]: Without dead ends: 2154 [2020-11-30 00:22:52,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-11-30 00:22:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-11-30 00:22:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-11-30 00:22:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-11-30 00:22:52,718 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-11-30 00:22:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:52,719 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-11-30 00:22:52,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:22:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-11-30 00:22:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:22:52,723 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:52,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:52,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:22:52,724 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1258925188, now seen corresponding path program 1 times [2020-11-30 00:22:52,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:52,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615171830] [2020-11-30 00:22:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:52,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615171830] [2020-11-30 00:22:52,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:52,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:22:52,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051498357] [2020-11-30 00:22:52,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:22:52,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:22:52,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:52,905 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 5 states. [2020-11-30 00:22:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:53,046 INFO L93 Difference]: Finished difference Result 2322 states and 8524 transitions. [2020-11-30 00:22:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:22:53,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-30 00:22:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:53,083 INFO L225 Difference]: With dead ends: 2322 [2020-11-30 00:22:53,083 INFO L226 Difference]: Without dead ends: 2066 [2020-11-30 00:22:53,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:22:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-11-30 00:22:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2020-11-30 00:22:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2020-11-30 00:22:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 7728 transitions. [2020-11-30 00:22:53,160 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 7728 transitions. Word has length 16 [2020-11-30 00:22:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:53,160 INFO L481 AbstractCegarLoop]: Abstraction has 2066 states and 7728 transitions. [2020-11-30 00:22:53,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:22:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 7728 transitions. [2020-11-30 00:22:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 00:22:53,165 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:53,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:53,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:22:53,167 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1060358638, now seen corresponding path program 1 times [2020-11-30 00:22:53,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:53,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919236074] [2020-11-30 00:22:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:53,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919236074] [2020-11-30 00:22:53,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:53,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:22:53,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424002068] [2020-11-30 00:22:53,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:22:53,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:53,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:22:53,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:22:53,311 INFO L87 Difference]: Start difference. First operand 2066 states and 7728 transitions. Second operand 7 states. [2020-11-30 00:22:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:53,492 INFO L93 Difference]: Finished difference Result 2358 states and 8640 transitions. [2020-11-30 00:22:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:22:53,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-30 00:22:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:53,504 INFO L225 Difference]: With dead ends: 2358 [2020-11-30 00:22:53,505 INFO L226 Difference]: Without dead ends: 2162 [2020-11-30 00:22:53,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:22:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2020-11-30 00:22:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2106. [2020-11-30 00:22:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-11-30 00:22:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7832 transitions. [2020-11-30 00:22:53,589 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7832 transitions. Word has length 17 [2020-11-30 00:22:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:53,590 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7832 transitions. [2020-11-30 00:22:53,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:22:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7832 transitions. [2020-11-30 00:22:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:22:53,649 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:53,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:53,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:22:53,650 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -27657637, now seen corresponding path program 1 times [2020-11-30 00:22:53,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:53,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584649735] [2020-11-30 00:22:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:53,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584649735] [2020-11-30 00:22:53,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:53,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:22:53,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784564518] [2020-11-30 00:22:53,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:22:53,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:22:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:22:53,889 INFO L87 Difference]: Start difference. First operand 2106 states and 7832 transitions. Second operand 8 states. [2020-11-30 00:22:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:54,153 INFO L93 Difference]: Finished difference Result 2522 states and 9068 transitions. [2020-11-30 00:22:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:22:54,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-11-30 00:22:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:54,164 INFO L225 Difference]: With dead ends: 2522 [2020-11-30 00:22:54,165 INFO L226 Difference]: Without dead ends: 2066 [2020-11-30 00:22:54,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:22:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-11-30 00:22:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1898. [2020-11-30 00:22:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-11-30 00:22:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 6944 transitions. [2020-11-30 00:22:54,242 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 6944 transitions. Word has length 18 [2020-11-30 00:22:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:54,243 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 6944 transitions. [2020-11-30 00:22:54,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:22:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 6944 transitions. [2020-11-30 00:22:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:22:54,248 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:54,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:54,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:22:54,249 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1306898107, now seen corresponding path program 1 times [2020-11-30 00:22:54,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:54,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694406064] [2020-11-30 00:22:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:54,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694406064] [2020-11-30 00:22:54,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:54,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:22:54,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147773877] [2020-11-30 00:22:54,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:22:54,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:54,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:22:54,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:22:54,361 INFO L87 Difference]: Start difference. First operand 1898 states and 6944 transitions. Second operand 4 states. [2020-11-30 00:22:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:54,404 INFO L93 Difference]: Finished difference Result 1970 states and 6574 transitions. [2020-11-30 00:22:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:22:54,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 00:22:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:54,411 INFO L225 Difference]: With dead ends: 1970 [2020-11-30 00:22:54,411 INFO L226 Difference]: Without dead ends: 1490 [2020-11-30 00:22:54,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-11-30 00:22:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2020-11-30 00:22:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-11-30 00:22:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4922 transitions. [2020-11-30 00:22:54,462 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4922 transitions. Word has length 18 [2020-11-30 00:22:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:54,464 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 4922 transitions. [2020-11-30 00:22:54,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:22:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4922 transitions. [2020-11-30 00:22:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 00:22:54,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:54,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:54,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:22:54,489 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash -467514533, now seen corresponding path program 1 times [2020-11-30 00:22:54,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:54,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839693285] [2020-11-30 00:22:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:54,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839693285] [2020-11-30 00:22:54,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:54,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:22:54,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871228434] [2020-11-30 00:22:54,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:22:54,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:54,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:22:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:54,604 INFO L87 Difference]: Start difference. First operand 1490 states and 4922 transitions. Second operand 5 states. [2020-11-30 00:22:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:54,678 INFO L93 Difference]: Finished difference Result 1282 states and 3882 transitions. [2020-11-30 00:22:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:22:54,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-30 00:22:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:54,683 INFO L225 Difference]: With dead ends: 1282 [2020-11-30 00:22:54,684 INFO L226 Difference]: Without dead ends: 982 [2020-11-30 00:22:54,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:22:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2020-11-30 00:22:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2020-11-30 00:22:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-11-30 00:22:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2920 transitions. [2020-11-30 00:22:54,719 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2920 transitions. Word has length 19 [2020-11-30 00:22:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:54,720 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 2920 transitions. [2020-11-30 00:22:54,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:22:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2920 transitions. [2020-11-30 00:22:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 00:22:54,723 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:54,723 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-30 00:22:54,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:22:54,724 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1857918314, now seen corresponding path program 1 times [2020-11-30 00:22:54,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:54,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904514576] [2020-11-30 00:22:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:54,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904514576] [2020-11-30 00:22:54,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:54,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:22:54,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993406601] [2020-11-30 00:22:54,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:22:54,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:22:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:22:54,794 INFO L87 Difference]: Start difference. First operand 982 states and 2920 transitions. Second operand 4 states. [2020-11-30 00:22:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:54,834 INFO L93 Difference]: Finished difference Result 1445 states and 4142 transitions. [2020-11-30 00:22:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:22:54,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-30 00:22:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:54,838 INFO L225 Difference]: With dead ends: 1445 [2020-11-30 00:22:54,839 INFO L226 Difference]: Without dead ends: 1002 [2020-11-30 00:22:54,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-11-30 00:22:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 970. [2020-11-30 00:22:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-11-30 00:22:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2734 transitions. [2020-11-30 00:22:54,874 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2734 transitions. Word has length 20 [2020-11-30 00:22:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:54,874 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 2734 transitions. [2020-11-30 00:22:54,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:22:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2734 transitions. [2020-11-30 00:22:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:22:54,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:54,878 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] [2020-11-30 00:22:54,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:22:54,878 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash -21138615, now seen corresponding path program 1 times [2020-11-30 00:22:54,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:54,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083353111] [2020-11-30 00:22:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:55,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083353111] [2020-11-30 00:22:55,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:55,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:22:55,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53565390] [2020-11-30 00:22:55,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:22:55,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:55,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:22:55,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:22:55,006 INFO L87 Difference]: Start difference. First operand 970 states and 2734 transitions. Second operand 7 states. [2020-11-30 00:22:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:55,101 INFO L93 Difference]: Finished difference Result 1460 states and 4050 transitions. [2020-11-30 00:22:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:22:55,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-30 00:22:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:55,105 INFO L225 Difference]: With dead ends: 1460 [2020-11-30 00:22:55,105 INFO L226 Difference]: Without dead ends: 740 [2020-11-30 00:22:55,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:22:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-11-30 00:22:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-11-30 00:22:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-11-30 00:22:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1995 transitions. [2020-11-30 00:22:55,130 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1995 transitions. Word has length 21 [2020-11-30 00:22:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:55,131 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1995 transitions. [2020-11-30 00:22:55,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:22:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1995 transitions. [2020-11-30 00:22:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:22:55,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:55,133 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] [2020-11-30 00:22:55,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:22:55,134 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254035, now seen corresponding path program 2 times [2020-11-30 00:22:55,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:55,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817641983] [2020-11-30 00:22:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:55,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817641983] [2020-11-30 00:22:55,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:55,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:22:55,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403975523] [2020-11-30 00:22:55,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:22:55,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:22:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:22:55,241 INFO L87 Difference]: Start difference. First operand 740 states and 1995 transitions. Second operand 7 states. [2020-11-30 00:22:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:55,325 INFO L93 Difference]: Finished difference Result 1070 states and 2837 transitions. [2020-11-30 00:22:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:22:55,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-30 00:22:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:55,328 INFO L225 Difference]: With dead ends: 1070 [2020-11-30 00:22:55,328 INFO L226 Difference]: Without dead ends: 580 [2020-11-30 00:22:55,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:22:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-11-30 00:22:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2020-11-30 00:22:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-11-30 00:22:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1477 transitions. [2020-11-30 00:22:55,347 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1477 transitions. Word has length 21 [2020-11-30 00:22:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:55,349 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 1477 transitions. [2020-11-30 00:22:55,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:22:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1477 transitions. [2020-11-30 00:22:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:22:55,352 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:55,352 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] [2020-11-30 00:22:55,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:22:55,353 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:55,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1080202451, now seen corresponding path program 3 times [2020-11-30 00:22:55,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:55,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26235882] [2020-11-30 00:22:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:55,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26235882] [2020-11-30 00:22:55,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:55,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:22:55,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643132081] [2020-11-30 00:22:55,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:22:55,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:22:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:22:55,475 INFO L87 Difference]: Start difference. First operand 580 states and 1477 transitions. Second operand 6 states. [2020-11-30 00:22:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:55,582 INFO L93 Difference]: Finished difference Result 811 states and 1988 transitions. [2020-11-30 00:22:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:22:55,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-30 00:22:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:55,584 INFO L225 Difference]: With dead ends: 811 [2020-11-30 00:22:55,584 INFO L226 Difference]: Without dead ends: 592 [2020-11-30 00:22:55,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:22:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-11-30 00:22:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 564. [2020-11-30 00:22:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2020-11-30 00:22:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1366 transitions. [2020-11-30 00:22:55,603 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1366 transitions. Word has length 21 [2020-11-30 00:22:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:55,604 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 1366 transitions. [2020-11-30 00:22:55,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:22:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1366 transitions. [2020-11-30 00:22:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:22:55,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:55,606 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] [2020-11-30 00:22:55,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:22:55,607 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash -652683463, now seen corresponding path program 1 times [2020-11-30 00:22:55,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:55,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595267332] [2020-11-30 00:22:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:55,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595267332] [2020-11-30 00:22:55,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:55,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:22:55,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373070269] [2020-11-30 00:22:55,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:22:55,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:22:55,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:22:55,688 INFO L87 Difference]: Start difference. First operand 564 states and 1366 transitions. Second operand 6 states. [2020-11-30 00:22:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:55,769 INFO L93 Difference]: Finished difference Result 463 states and 1059 transitions. [2020-11-30 00:22:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:22:55,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-30 00:22:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:55,771 INFO L225 Difference]: With dead ends: 463 [2020-11-30 00:22:55,771 INFO L226 Difference]: Without dead ends: 322 [2020-11-30 00:22:55,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:22:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-11-30 00:22:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2020-11-30 00:22:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-11-30 00:22:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-11-30 00:22:55,780 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 21 [2020-11-30 00:22:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:55,780 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-11-30 00:22:55,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:22:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-11-30 00:22:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:22:55,783 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:55,783 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-30 00:22:55,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:22:55,784 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2083782188, now seen corresponding path program 1 times [2020-11-30 00:22:55,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:55,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270816031] [2020-11-30 00:22:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:55,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270816031] [2020-11-30 00:22:55,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:55,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:22:55,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717097877] [2020-11-30 00:22:55,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:22:55,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:55,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:22:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:22:55,890 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-11-30 00:22:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:55,995 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-11-30 00:22:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:22:55,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-30 00:22:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:55,996 INFO L225 Difference]: With dead ends: 293 [2020-11-30 00:22:55,996 INFO L226 Difference]: Without dead ends: 65 [2020-11-30 00:22:55,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:22:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-30 00:22:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-30 00:22:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-30 00:22:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-11-30 00:22:55,999 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-11-30 00:22:55,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:55,999 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-11-30 00:22:55,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:22:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-11-30 00:22:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 00:22:56,000 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:22:56,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:56,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:22:56,000 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:22:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 773461534, now seen corresponding path program 1 times [2020-11-30 00:22:56,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:56,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498426269] [2020-11-30 00:22:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:56,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:56,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:56,168 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:56,169 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:22:56,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:22:56,208 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,208 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,208 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-30 00:22:56,210 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,210 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,211 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,211 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,211 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,211 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,212 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,212 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,212 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,213 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,213 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,213 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,214 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,215 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,215 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,215 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,215 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,222 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,222 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,222 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,223 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,223 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,224 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,224 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,224 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,226 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,226 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,228 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,228 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,228 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,228 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:22:56 BasicIcfg [2020-11-30 00:22:56,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:22:56,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:22:56,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:22:56,353 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:22:56,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:22:42" (3/4) ... [2020-11-30 00:22:56,356 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:22:56,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,375 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-30 00:22:56,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:22:56,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:22:56,530 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0fca4846-5686-420d-82be-4ca9270ae440/bin/uautomizer/witness.graphml [2020-11-30 00:22:56,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:22:56,532 INFO L168 Benchmark]: Toolchain (without parser) took 17680.68 ms. Allocated memory was 92.3 MB in the beginning and 442.5 MB in the end (delta: 350.2 MB). Free memory was 59.8 MB in the beginning and 362.7 MB in the end (delta: -302.9 MB). Peak memory consumption was 46.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:56,533 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 92.3 MB. Free memory was 48.3 MB in the beginning and 48.3 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:22:56,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.95 ms. Allocated memory is still 92.3 MB. Free memory was 59.6 MB in the beginning and 45.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:56,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.13 ms. Allocated memory is still 92.3 MB. Free memory was 45.5 MB in the beginning and 42.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:56,535 INFO L168 Benchmark]: Boogie Preprocessor took 41.37 ms. Allocated memory is still 92.3 MB. Free memory was 42.6 MB in the beginning and 40.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:56,535 INFO L168 Benchmark]: RCFGBuilder took 2515.62 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 40.1 MB in the beginning and 105.3 MB in the end (delta: -65.2 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:56,535 INFO L168 Benchmark]: TraceAbstraction took 14072.88 ms. Allocated memory was 134.2 MB in the beginning and 442.5 MB in the end (delta: 308.3 MB). Free memory was 104.2 MB in the beginning and 383.7 MB in the end (delta: -279.4 MB). Peak memory consumption was 278.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:56,536 INFO L168 Benchmark]: Witness Printer took 177.74 ms. Allocated memory is still 442.5 MB. Free memory was 383.7 MB in the beginning and 362.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:56,538 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 92.3 MB. Free memory was 48.3 MB in the beginning and 48.3 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 806.95 ms. Allocated memory is still 92.3 MB. Free memory was 59.6 MB in the beginning and 45.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 58.13 ms. Allocated memory is still 92.3 MB. Free memory was 45.5 MB in the beginning and 42.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.37 ms. Allocated memory is still 92.3 MB. Free memory was 42.6 MB in the beginning and 40.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2515.62 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 40.1 MB in the beginning and 105.3 MB in the end (delta: -65.2 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14072.88 ms. Allocated memory was 134.2 MB in the beginning and 442.5 MB in the end (delta: 308.3 MB). Free memory was 104.2 MB in the beginning and 383.7 MB in the end (delta: -279.4 MB). Peak memory consumption was 278.4 MB. Max. memory is 16.1 GB. * Witness Printer took 177.74 ms. Allocated memory is still 442.5 MB. Free memory was 383.7 MB in the beginning and 362.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1891 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 203 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.6s, 130 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 7608 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1261; [L845] FCALL, FORK 0 pthread_create(&t1261, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1262; [L847] FCALL, FORK 0 pthread_create(&t1262, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1263; [L849] FCALL, FORK 0 pthread_create(&t1263, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1264; [L851] FCALL, FORK 0 pthread_create(&t1264, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix047_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 605 SDtfs, 939 SDslu, 1136 SDs, 0 SdLazy, 348 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 284 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 23428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...